Function Run Fun
Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 20 Accepted Submission(s) : 16
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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
冬练三九之一
#include<string>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <math.h>
#include <stdlib.h>
#include <time.h>
#include<iomanip>
#include<memory.h>
using namespace std;
int ans[30][30][30];
int f(int a,int b,int c)
{
if(a<=0||b<=0||c<=0)return 1;
else if(a>20||b>20||c>20)return f(20,20,20);
else if(ans[a][b][c])return ans[a][b][c];
else if(a<b&&b<c)ans[a][b][c]= f(a, b, c-1) + f(a, b-1, c-1) - f(a, b-1, c);
else ans[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);
return ans[a][b][c];
}
int main()
{
int a,b,c;
memset(ans,0,sizeof(ans));
while(cin>>a>>b>>c)
{
if(a==-1&&b==-1&&c==-1)break;
else{
printf("w(%d, %d, %d) = %d\n",a,b,c,f(a,b,c));
}
}
return 0;
}