记忆化搜索 水
#include "stdio.h"
#include "string.h"
int dp[21][21][21];
int dfs(int a,int b,int c)
{
if (dp[a][b][c]) return dp[a][b][c];
if (a<=0 || b<=0 || c<=0) return 1;
if (a<b && b<c)
return dfs(a,b,c-1)+dfs(a,b-1,c-1)-dfs(a,b-1,c);
else
return dfs(a-1,b,c)+dfs(a-1,b-1,c)+dfs(a-1,b,c-1)-dfs(a-1,b-1,c-1);
}
int main()
{
int i,j,k,a,b,c;
memset(dp,0,sizeof(dp));
for (i=1;i<=20;i++)
for (j=1;j<=20;j++)
for (k=1;k<=20;k++)
if (dp[i][j][k]==0)
dp[i][j][k]=dfs(i,j,k);
while (scanf("%d%d%d",&a,&b,&c)!=EOF)
{
if (a==-1 && b==-1 && c==-1) break;
printf("w(%d, %d, %d) = ",a,b,c);
if (a<=0 || b<=0 || c<=0) printf("1\n");
else
if (a>20 || b>20 || c>20) printf("1048576\n");
else
printf("%d\n",dp[a][b][c]);
}
return 0;
}