洛谷 P1464

题目链接：Function

emmmm

挺好的一道记忆化搜索的题。。。

（刚开始根据题意进行模拟。。。hhh

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
long long a,b,c;
int jiyi[50][50][50];
long long w(long long  a,long long  b,long long c)
{
	//cout<<a<<" "<<b<<" "<<c<<endl;
	if(a<=0 || b<=0 || c<=0)
		return 1;
	else if(a>20 || b >20||c>20)
		return w(20,20,20);
	else if(jiyi[a][b][c] == 0)
	{
		if(a<b && b<c)
			jiyi[a][b][c] = w(a,b,c-1) + w(a-1,b,c-1) - w(a-1,b-1,b-1);
		else jiyi[a][b][c] = w(a-1,b,c)+w(a-1,b-1,c)+w(a-1,b,c-1)-w(a-1,b-1,c-1);
	}
	return jiyi[a][b][c];
}
int main()
{
	while(1)
	{
		cin>>a>>b>>c;
		if(a == -1 && b == -1 && c == -1)
		{
			break;
		}
		long long ans = w(a,b,c);
		printf("w(%lld, %lld, %lld) = %lld\n",a,b,c,ans);
	}
	return 0;
}