Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2173 Accepted Submission(s): 1104
1 #include<cstdio> 2 #include<cmath> 3 #include<cstring> 4 #include<stdlib.h> 5 #include<algorithm> 6 using namespace std; 7 int w[100][100][100]; 8 int f(int a,int b,int c) 9 { 10 if(a<=0||b<=0||c<=0) 11 return 1; 12 else if(a>20||b>20||c>20) 13 return f(20,20,20); 14 else if(a<b&&b<c) 15 { 16 if(!w[a][b][c]) 17 w[a][b][c]=f(a,b,c-1)+f(a,b-1,c-1)-f(a,b-1,c); 18 return w[a][b][c]; 19 } 20 else 21 { 22 if(!w[a][b][c]) 23 w[a][b][c]=f(a-1,b,c)+f(a-1,b-1,c)+f(a-1,b,c-1)-f(a-1,b-1,c-1); 24 return w[a][b][c]; 25 } 26 } 27 int main() 28 { 29 int a,b,c; 30 memset(w,0,sizeof(w)); 31 while(scanf("%d %d %d",&a,&b,&c)!=EOF) 32 { 33 if(a==-1&&b==-1&&c==-1) 34 break; 35 printf("w(%d, %d, %d) = %d\n",a,b,c,f(a,b,c)); 36 } 37 return 0; 38 }
HDU 1331 Function Run Fun,布布扣,bubuko.com
原文:http://www.cnblogs.com/clliff/p/3898448.html