Function Run Fun
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1354 Accepted Submission(s): 693
Problem Description
We all love recursion! Don't we?
Consider a three-parameter recursive function w(a, b, c):
if a <= 0 or b <= 0 or c <= 0, then w(a, b, c) returns:
1
if a > 20 or b > 20 or c > 20, then w(a, b, c) returns:
w(20, 20, 20)
if a < b and b < c, then w(a, b, c) returns:
w(a, b, c-1) + w(a, b-1, c-1) - w(a, b-1, c)
otherwise it returns:
w(a-1, b, c) + w(a-1, b-1, c) + w(a-1, b, c-1) - w(a-1, b-1, c-1)
This is an easy function to implement. The problem is, if implemented directly, for moderate values of a, b and c (for example, a = 15, b = 15, c = 15), the program takes hours to run because of the massive recursion.
Consider a three-parameter recursive function w(a, b, c):
if a <= 0 or b <= 0 or c <= 0, then w(a, b, c) returns:
1
if a > 20 or b > 20 or c > 20, then w(a, b, c) returns:
w(20, 20, 20)
if a < b and b < c, then w(a, b, c) returns:
w(a, b, c-1) + w(a, b-1, c-1) - w(a, b-1, c)
otherwise it returns:
w(a-1, b, c) + w(a-1, b-1, c) + w(a-1, b, c-1) - w(a-1, b-1, c-1)
This is an easy function to implement. The problem is, if implemented directly, for moderate values of a, b and c (for example, a = 15, b = 15, c = 15), the program takes hours to run because of the massive recursion.
Input
The input for your program will be a series of integer triples, one per line, until the end-of-file flag of -1 -1 -1. Using the above technique, you are to calculate w(a, b, c) efficiently and print the result.
Output
Print the value for w(a,b,c) for each triple.
Sample Input
1 1 1 2 2 2 10 4 6 50 50 50 -1 7 18 -1 -1 -1
Sample Output
w(1, 1, 1) = 2 w(2, 2, 2) = 4 w(10, 4, 6) = 523 w(50, 50, 50) = 1048576 w(-1, 7, 18) = 1
Source
Recommend
Ignatius.L
网址:http://acm.hdu.edu.cn/showproblem.php?pid=1331
***************************************************************
***************************************************************
代码:
#include<stdio.h>
int w[22][22][22];
int abc(int x,int y,int z){
if(x<=0||y<=0||z<=0)
return 1;
else if(x>20||y>20||z>20)
return w[20][20][20];
else
return w[x][y][z];
return 1;
}
int main(){
int i,j,z,a,b,c;
for(i=1;i<=20;i++)
for(j=1;j<=20;j++)
for(z=1;z<=20;z++)
{
if(i<j&&j<z)w[i][j][z]=abc(i,j,z-1)+abc(i,j-1,z-1)-abc(i,j-1,z);
else w[i][j][z]=abc(i-1,j,z)+abc(i-1,j-1,z)+abc(i-1,j,z-1)-abc(i-1,j-1,z-1);
}
while(scanf("%d%d%d",&a,&b,&c)&&(a!=-1||b!=-1||c!=-1)){
printf("w(%d, %d, %d) = %d\n",a,b,c,abc(a, b, c));
}
return 0;
}