POJ1579Function Run Fun
来源:互联网 发布:动漫漫依淘宝 编辑:程序博客网 时间:2024/06/06 12:40
Function Run Fun
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 13471 Accepted: 7014
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 12 2 210 4 650 50 50-1 7 18-1 -1 -1
Sample Output
w(1, 1, 1) = 2w(2, 2, 2) = 4w(10, 4, 6) = 523w(50, 50, 50) = 1048576w(-1, 7, 18) = 1
#include<iostream>#include<cstdio>#include<cstring>using namespace std;int w[25][25][25];int DFS(int a,int b,int c){if(a<=0 || b<=0 || c<=0){return 1;}if(a>20 || b>20 || c>20){return DFS(20,20,20);}if(w[a][b][c]!=-1){return w[a][b][c];}if(a<b && b<c){w[a][b][c] = DFS(a, b, c-1) + DFS(a, b-1, c-1) - DFS(a, b-1, c);}else{w[a][b][c] = DFS(a-1, b, c) + DFS(a-1, b-1, c) + DFS(a-1, b, c-1) - DFS(a-1, b-1, c-1);}return w[a][b][c];}int main(){freopen("in.txt","r",stdin);int i,j,k;memset(w,-1,sizeof(w));while(cin>>i>>j>>k){if(i==-1&&j==-1&&k==-1)break;printf("w(%d, %d, %d) = %d\n",i,j,k,DFS(i,j,k));}}
- POJ1579Function Run Fun
- Function Run Fun(ZJU_1168)
- POJ_1579_Function Run Fun
- PKUOJ1579 Function Run Fun
- Function Run Fun
- poj1579 Function Run Fun
- [ACM]Function Run Fun
- POJ1579:Function Run Fun
- Function Run Fun
- Function Run Fun
- 1626. Function Run Fun
- POJ Function Run Fun
- POJ1579.Function Run Fun
- Function Run Fun
- HDU1331 Function Run Fun
- Function Run Fun
- HDU Function Run Fun
- hrbust Function Run Fun
- PID和UID的权限问题
- STL六大组件
- div+css position 定位问题
- BaseService类
- 转 Ant builder详解
- POJ1579Function Run Fun
- vs2010环境下调试程序出现0xc000007b问题
- spring与DWR集成的两种方法
- 新一届中国领导人产生
- BaseServiceImpl类
- VNC许可密钥
- 内核模块编译时怎样绕过insmod时的版本检查
- 修改数据库排序规则
- --java-- 十二周 【任务一】编写一个Panel的子类MyPanel,MyPanel中有一个文本框和一个按钮,要求MyPanel的实例作为其按钮的ActionEvent事件的监视器