Function Run Fu

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.
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<stdio.h>
#include<string.h>
#define Max 25
int a,b,c;
int f[Max][Max][Max];
int dfs(int x,int y,int z)
{
	if(x<=0||y<=0||z<=0) return 1;
	if(x>20||y>20||z>20) return dfs(20,20,20);
	if(f[x][y][z]) return f[x][y][z];
	if(x<y&&y<z) f[x][y][z]=(dfs(x,y,z-1)+dfs(x,y-1,z-1)-dfs(x,y-1,z));
	else f[x][y][z]=dfs(x-1, y, z) + dfs(x-1, y-1, z) + dfs(x-1, y, z-1) - dfs(x-1, y-1, z-1) ;
	return f[x][y][z];
}
int main()
{
	//freopen("b.txt","r",stdin);
	memset(f,0,sizeof(f));
	while(scanf("%d %d %d",&a,&b,&c)==3)
	{
		if(a==-1&&b==-1&&c==-1) break;
		printf("w(%d, %d, %d) = %d\n",a,b,c,dfs(a,b,c));
	}
	return 0;
}