# poj 1579 Function Run Fun(记忆化搜索)

Function Run Fun
 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 18256 Accepted: 9328

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:

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

思路：递归+通过记录消除冗余

代码：
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;

int issolved[100][100][100];

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

int main(){
int x,y,z;
memset(issolved,0,sizeof(issolved));
while(~scanf("%d%d%d",&x,&y,&z)){
if(x==-1&&y==-1&&z==-1) break;
int ans=solve(x,y,z);
printf("w(%d, %d, %d) = %d\n",x,y,z,ans);
}
return 0;
} 

• 本文已收录于以下专栏：

## POJ 1579-Function Run Fun（记忆化搜索）

Function Run Fun Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 16503 ...

## POJ 1579-Function Run Fun（记忆化搜索-递归）

Function Run Fun Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 18930 ...

## 记忆化搜索：POJ1579-Function Run Fun（最基础的记忆化搜索）

Function Run Fun Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 14815 Accepted: ...

## POJ1579——Function Run Fun（记忆化递归）

Function Run Fun Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 20000/10000K (Java/Other)...

## Function Run Fun （HDU 1331） —— 记忆化搜索DP

Function Run Fun Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others...

## Hdu oj 1331 Function Run Fun(记忆化搜索）

Function Run Fun Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others...

## HDU 1331 Function Run Fun (基础记忆化搜索)

HDU 1331 Function Run Fun (基础记忆化搜索)

## ACM 记忆化搜索 Function Run Fun & FatMouse and Cheese

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)