Function Run Fun

Function Run Fun

Time Limit : 2000/1000ms (Java/Other) Memory Limit :65536/32768K (Java/Other)

Total Submission(s) : 0 Accepted Submission(s) : 0

Font:Times New Roman | Verdana | Georgia

Font Size:← →

Problem Description

We all loverecursion! 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), theprogram takes hours to run because of the massive recursion.

Input

The input foryour program will be a series of integer triples, one per line, until theend-of-file flag of -1 -1 -1. Using the abovetechnique, you are to calculate w(a, b, c) efficiently and print the result.

Output

Print thevalue 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

Pacific Northwest 1999 

源代码：

#include<iostream>

using namespace std;


int dp[21][21][21];
int DP(int a,int b,int c)
{    if(a<=0||b<=0||c<=0) return 1;
     else if(a>20||b>20||c>20) return DP(20,20,20);
     else if(a<b&&b<c)
     {    if(dp[a][b][c]) return dp[a][b][c];
          dp[a][b][c]=DP(a,b,c-1)+DP(a,b-1,c-1)-DP(a,b-1,c);
     }
     else 
     {    if(dp[a][b][c]) return dp[a][b][c];
          dp[a][b][c]=DP(a-1,b,c)+DP(a-1,b-1,c)+DP(a-1,b,c-1)-DP(a-1,b-1,c-1);
     }
return dp[a][b][c];
}


int main()
{    int a,b,c;
     while(scanf("%d%d%d",&a,&b,&c))
     {    if(a==-1&&b==-1&&c==-1) break;
          //memset(dp,0,sizeof(dp));
          printf("w(%d, %d, %d) = %d\n",a,b,c,DP(a,b,c));
     }
return 0;
}