HDU 1502 DP+大数

转移方程 ?ans[n][n][n]=ans[n-1][n][n]+ans[n][n-1][n]+ans[n][n][n-1];

#include "stdio.h"
#include "string.h"
#include "math.h"

int ans[61][61][61][31];

void make(int a,int b,int c)
{
	int i,max;
	for (i=0;i<=ans[a][b][c-1][0];i++)
		ans[a][b][c][i]=ans[a][b][c-1][i];

	if (b-1>=c && b-1>=0)
	{
		max=ans[a][b][c][0];
		if (ans[a][b-1][c][0]>max) max=ans[a][b-1][c][0];
		for (i=1;i<=max;i++)
			ans[a][b][c][i]+=ans[a][b-1][c][i];
		for (i=1;i<=max;i++)
		{
			ans[a][b][c][i+1]+=ans[a][b][c][i]/10000;
			ans[a][b][c][i]%=10000;
		}
		if (ans[a][b][c][max+1]!=0) max++;
		ans[a][b][c][0]=max;
	}

	if (a-1>=b && a-1>=c)
	{
		max=ans[a][b][c][0];
		if (ans[a-1][b][c][0]>max) max=ans[a-1][b][c][0];

		for (i=1;i<=max;i++)
			ans[a][b][c][i]+=ans[a-1][b][c][i];
		for (i=1;i<=max;i++)
		{
			ans[a][b][c][i+1]+=ans[a][b][c][i]/10000;
			ans[a][b][c][i]%=10000;
		}
		if (ans[a][b][c][max+1]!=0) max++;
		ans[a][b][c][0]=max;
	}
}
  





int main()
{
	int i,j,k,n;
	memset(ans,sizeof(ans));

	ans[0][0][0][1]=ans[0][0][0][0]=1;


	for (i=1;i<=60;i++)
		for (j=0;j<=i;j++)
			for (k=0;k<=j;k++)
				make(i,k);

	while (scanf("%d",&n)!=EOF)
	{
		printf("%d",ans[n][n][n][ans[n][n][n][0]]);
		for (i=ans[n][n][n][0]-1;i>=1;i--)
			printf("%04d",ans[n][n][n][i]);
		printf("nn");
	}
	return 0;
}