HDU 1331 将递归改成迭代打表

http://acm.hdu.edu.cn/showproblem.php?pid=1331

dp打表就是这么个过程了

 1 #include<stdio.h>
 2 #include<stdlib.h>
 3 int main()
 4 {
 5     int i,j,k,a,b,c;
 6     int w[21][21][21];
 7     for(i=0;i<21;i++)
 8       for(j=0;j<21;j++)
 9         for(k=0;k<21;k++)
10         {
11             if(i==0||j==0||k==0)w[i][j][k]=1;
12             else if(i<j&&j<k)w[i][j][k]=w[i][j][k-1]+w[i][j-1][k-1]-w[i][j-1][k];
13             else w[i][j][k]=w[i-1][j][k]+w[i-1][j-1][k]+w[i-1][j][k-1]-w[i-1][j-1][k-1];
14         }
15     while(scanf("%d%d%d",&a,&b,&c),a!=-1||b!=-1||c!=-1)
16     {
17        if(a<=0||b<=0||c<=0)k=1;
18        else if(a>20||b>20||c>20)k=w[20][20][20];
19        else k=w[a][b][c];
20        printf("w(%d, %d, %d) = %d\n",a,b,c,k);
21     }
22     return 0;
23 } 

View Code

 

转载于:https://www.cnblogs.com/huzhenbo113/p/3241930.html