hdu 1502 动态规划+大数

首先说，我的代码很省时间，就如大家都看到了，我用的是打表，并且是真的把表打出来贴到代码里了。

题意：给一个字符串，只有ABC组成，并且A、B、C的个数都是n（0<n<=60）个，问你存在多少个组合方式满足条件：任以前X项中，A的个数大于等于B的个数，B的个数大于等于C的个数。

解题：设函数dp[i][j][k]表示该序列中有i个A，j个B，k个C组成，则dp[i][j][k]是有dp[i-1][j][k]，dp[i][j-1][k]，dp[i][j][k-1]这三个添加过来的，所以动态转移方程式

dp[i][j][k]=dp[i-1][j][k]+dp[i][j-1][k]+dp[i][j][k-1]；同时注意，dp的结果很大，要用到大数。

设sum[i]表示当n为i时的结果，即当i==j==k时的结果。

代码如下（其中注释部分为打表过程，如果不把表打出来，用注释部分，超存，但是可以有个优化，就是把dp定义为char型的数组，这样就不会超存了）：

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <cmath>
#define N 100
using namespace std;

int num[62][N]={{0},{1,1},{1,5},{2,2,4},{3,2,6,4},{4,6,0,0,6},{5,6,1,5,7,8},{7,0,7,6,5,8,3,1},{8,4,3,6,1,7,3,3,2},{9,0,3,3,5,1,3,4,1,4},{10,0,9,0,1,0,0,6,4,6,7},{12,0,4,6,4,7,1,2,6,8,5,4,1},{13,0,0,4,6,5,6,2,4,1,1,6,8,2},{14,0,2,1,7,2,9,3,9,0,8,6,4,7,5},{16,0,6,9,5,0,5,5,2,9,5,9,0,8,7,1,1},{17,0,3,4,6,9,8,4,7,9,9,8,0,4,8,5,4,2},{18,0,3,3,4,2,8,1,7,2,9,9,2,6,8,0,1,2,5},{20,0,5,2,0,7,4,4,9,8,1,0,5,4,8,7,8,9,1,1,1},{21,0,5,6,1,3,6,8,9,7,2,7,3,4,7,9,1,6,6,3,4,2},{22,0,0,3,6,9,8,9,6,5,1,0,2,6,3,4,3,6,5,0,6,3,5},{24,0,0,9,0,0,5,2,0,7,6,1,8,4,1,6,6,9,8,5,1,1,9,1,1},{25,0,0,9,6,2,6,3,9,2,3,4,4,1,3,3,4,0,8,6,2,9,0,7,6,2},{26,0,0,0,6,5,9,8,6,7,5,6,0,3,6,3,8,2,2,1,7,1,6,8,3,0,6},{28,0,8,6,7,1,8,6,1,2,8,3,6,0,1,1,2,8,5,0,8,9,6,9,5,5,7,3,1},{29,2,5,5,5,2,9,1,1,7,9,3,6,8,6,5,6,0,5,1,3,4,8,7,0,4,5,5,1,3},{30,6,5,2,8,5,3,7,5,6,5,0,6,5,2,7,1,2,1,5,0,7,3,3,7,0,4,4,8,2,7},{32,6,5,0,5,7,8,0,2,8,5,7,1,0,5,8,7,3,9,8,1,8,3,9,5,2,1,0,6,1,9,6,1},{33,0,8,4,6,5,1,2,7,1,2,5,6,7,6,7,8,1,2,7,0,1,0,6,5,7,2,7,4,8,9,4,9,3},{34,2,7,8,5,7,5,7,5,3,2,0,0,6,1,2,3,0,0,7,3,1,5,4,9,0,5,9,2,8,8,9,6,2,9},{36,2,7,2,4,3,9,9,8,6,2,4,4,4,6,9,1,9,5,1,0,1,2,3,9,2,5,5,0,2,8,9,8,5,8,1,2},{37,6,3,1,5,8,6,3,7,8,8,7,6,1,4,6,0,8,4,9,0,3,6,0,2,4,6,0,9,6,6,5,0,4,7,7,1,5},{39,6,4,2,1,6,2,5,7,5,9,3,8,0,7,1,1,6,2,5,6,0,5,2,7,5,6,2,6,0,1,7,8,8,9,3,1,3,2,1},{40,0,7,9,6,8,6,9,9,7,2,4,1,6,5,9,7,2,7,5,6,3,4,0,8,6,7,3,8,3,9,2,4,7,1,1,2,0,4,9,2},{41,4,3,0,3,6,2,4,6,5,1,5,1,0,9,4,3,3,0,1,4,7,8,5,3,2,1,5,8,5,3,1,5,6,9,0,3,1,6,4,0,7},{43,0,7,7,6,9,8,4,5,8,2,8,8,8,4,5,1,8,2,6,9,2,8,9,1,7,9,7,2,9,1,2,9,0,2,3,7,6,2,4,4,9,6,1},{44,0,6,4,9,0,5,7,8,7,8,1,2,4,4,0,3,5,1,5,7,1,8,3,8,4,6,7,6,6,9,5,3,9,9,4,0,3,5,9,9,7,8,0,4},{45,0,6,6,3,9,2,4,6,9,8,1,3,0,9,6,2,5,9,3,0,7,3,9,0,2,4,2,0,0,8,0,8,6,4,9,0,4,2,1,8,1,3,9,8,9},{47,0,0,1,1,6,2,8,0,7,8,2,3,3,2,1,4,8,8,4,7,1,6,9,0,4,2,2,8,6,8,9,8,6,3,0,1,6,2,5,2,9,9,1,1,0,4,2},{48,0,8,0,7,4,4,6,7,1,7,7,4,5,5,3,4,6,5,2,0,9,6,8,3,3,2,6,6,4,9,4,7,5,0,0,4,8,5,5,6,5,9,4,1,4,4,8,5},{50,0,4,9,5,6,6,8,8,4,5,9,0,1,1,2,9,6,8,0,8,7,4,0,4,2,0,6,2,9,3,8,9,2,3,4,0,8,5,3,2,4,3,0,5,1,1,6,2,4,1},{51,0,2,0,7,5,6,5,0,9,8,1,0,8,0,4,2,2,9,4,1,6,0,7,1,5,0,0,0,8,5,4,0,1,4,6,8,2,0,0,5,8,9,3,3,4,6,7,8,8,4,3},{52,0,2,6,8,7,8,0,9,3,5,2,9,9,0,6,0,1,1,9,0,0,6,0,5,2,1,4,4,9,6,6,9,8,6,8,8,3,7,9,3,1,1,9,0,5,6,0,0,5,5,5,8},{54,0,0,5,7,7,1,0,6,5,8,4,9,8,5,5,2,1,3,1,3,7,0,7,3,9,5,1,0,9,3,6,5,8,3,5,9,8,0,4,1,6,3,3,2,8,3,2,8,7,5,2,0,1,2},{55,0,0,0,4,8,5,1,2,0,3,3,1,3,7,5,3,1,8,8,4,6,3,7,7,7,6,1,2,5,4,3,2,9,8,0,8,7,8,1,9,5,4,1,6,2,5,1,9,3,1,7,8,7,1,5},{57,0,0,0,8,0,0,3,5,9,0,3,6,8,5,0,9,1,8,7,1,3,8,5,5,0,2,7,8,6,7,4,9,9,2,1,3,3,9,6,1,2,5,1,4,6,4,3,7,3,6,6,6,1,8,7,2,1},{58,0,0,0,4,4,3,1,1,5,4,9,1,1,9,8,1,5,8,6,5,8,4,6,4,3,4,7,3,6,3,9,3,6,8,5,9,0,0,3,2,4,7,7,3,0,1,5,0,3,2,7,0,9,8,0,6,1,3},{59,0,0,0,4,0,7,1,4,5,9,8,4,9,5,5,3,8,3,8,3,0,2,9,5,1,7,7,9,6,4,1,1,0,5,0,3,6,1,1,2,3,2,0,2,5,7,4,1,8,3,6,1,1,1,6,1,3,8,7},{61,0,0,0,0,1,0,3,5,5,2,7,4,4,9,4,0,2,0,7,6,6,6,1,0,2,0,4,0,1,4,0,2,8,0,7,5,2,7,1,7,4,0,0,2,5,4,0,3,8,1,0,1,7,7,7,1,9,3,4,9,1},{62,0,0,4,6,5,5,2,4,4,2,4,5,1,3,9,6,5,7,6,0,9,8,1,9,4,4,8,4,2,0,6,4,5,2,4,7,3,1,5,2,5,9,2,0,1,0,1,0,9,8,5,1,8,5,3,2,5,4,3,3,8,4},{64,0,8,2,5,7,3,6,1,7,4,7,4,1,7,8,0,1,1,7,0,0,5,4,7,8,7,0,4,5,0,8,5,0,9,2,3,9,8,4,8,5,3,2,5,1,5,7,8,6,1,5,8,0,9,7,5,9,3,1,8,3,0,2,1},{65,0,4,8,3,7,6,8,6,2,2,1,4,9,6,1,7,5,6,7,1,3,4,7,8,8,6,9,2,8,8,7,1,1,1,5,8,3,2,4,8,9,6,8,3,4,8,5,8,3,8,0,5,3,9,3,8,4,3,8,9,9,2,0,0,3},{66,0,4,8,7,2,7,0,5,0,2,2,4,8,4,1,8,0,1,4,8,8,5,5,0,6,7,2,4,2,3,6,2,9,5,4,5,3,7,5,7,5,0,5,3,4,6,7,5,8,7,6,4,9,7,9,9,3,3,5,1,0,7,2,0,5,7},{68,0,0,2,5,7,7,1,7,6,5,1,1,6,0,5,0,3,6,0,9,8,6,7,9,3,9,7,8,2,5,4,6,7,8,5,8,3,9,5,1,4,9,9,1,7,7,1,9,6,3,6,5,0,4,8,2,0,9,6,7,2,8,4,2,7,7,8,1},{69,0,8,8,6,2,1,7,0,3,5,9,9,8,2,4,9,0,9,2,9,3,4,6,3,7,9,3,3,1,2,1,3,8,1,3,1,7,8,9,0,8,9,0,1,0,5,0,4,2,0,3,7,0,7,7,0,9,8,3,0,7,4,9,3,7,3,0,7,4},{71,0,8,0,8,3,6,0,6,1,3,7,9,2,7,6,5,4,5,7,6,7,4,2,3,9,7,8,8,0,8,6,4,9,5,2,1,7,7,6,5,9,7,2,0,0,3,5,2,1,5,9,5,5,6,0,2,3,5,8,8,3,4,9,9,0,1,2,0,8,1,1},{72,0,4,0,3,8,7,6,9,8,9,0,5,4,8,0,5,3,4,2,1,7,2,5,9,9,8,1,5,6,4,0,0,4,6,0,5,3,5,0,6,5,1,7,3,3,8,0,6,7,0,7,9,9,2,4,0,8,4,2,5,1,3,1,0,2,9,6,1,5,6,9,2},{73,0,4,4,5,2,7,0,1,4,3,0,8,9,9,4,1,8,8,7,2,7,6,4,8,8,6,0,0,6,9,9,6,3,3,6,3,2,5,8,8,8,1,6,1,4,2,3,3,6,7,1,0,5,6,0,4,0,0,9,7,0,3,1,1,2,3,3,0,2,9,5,4,7},{75,0,0,8,8,8,9,1,1,7,7,9,8,2,7,3,6,3,0,1,8,4,5,6,7,0,4,2,5,0,2,8,9,4,6,1,2,9,3,5,0,7,9,8,1,2,1,9,4,5,5,1,3,5,4,4,0,2,2,3,7,4,0,3,0,1,5,1,4,1,5,7,8,7,8,1},{76,0,6,9,0,2,3,2,4,6,2,4,3,3,0,6,0,2,3,3,1,1,4,6,9,6,0,2,5,5,5,3,8,9,2,7,0,8,3,0,4,7,0,0,2,6,1,6,8,1,7,5,9,6,7,0,6,8,7,9,2,7,5,0,2,9,4,0,9,8,7,3,6,7,3,7,4},{78,0,0,4,4,1,4,9,0,6,2,1,9,2,7,7,2,6,9,5,5,1,5,2,2,1,5,6,9,3,6,6,7,0,0,9,9,2,5,4,1,3,1,6,4,1,6,2,3,7,2,0,9,9,1,3,9,9,5,4,9,1,2,9,2,9,1,6,8,1,0,4,9,5,0,6,9,1,1},{79,0,0,2,1,5,6,1,2,8,8,6,2,4,4,1,3,6,4,3,8,1,2,5,2,7,9,1,8,5,8,6,7,5,2,6,4,0,8,6,6,0,9,6,0,0,9,7,1,0,6,2,1,3,0,2,2,3,4,8,4,9,3,9,2,6,3,2,5,7,6,5,0,2,1,9,2,2,0,3}};
//int dp[62][62][62][N];
//
//void sum(int a[N],int b[N])
//{
//	int n=a[0],m=b[0],i,j,k;
//	a[0]=k=max(n,m);	
//	for(i=1;i<=k;i++)
//	{
//		a[i]+=b[i];
//		if(a[i]>9)
//		{
//			a[i+1]++;			a[i]%=10;
//			if(i+1>k)
//			{
//				k++;a[0]++;
//			}
//		}
//	}
//}
//void cpy(int a[N],int b[N])
//{
//	int i;
//	for(i=0;i<=b[0];i++)
//	{
//		a[i]=b[i];
//	}
//}
//void add(int x,int y,int z)
//{
//	if(x-1>=0&&x-1>=y&&y>=z)
//		sum(dp[x][y][z],dp[x-1][y][z]);
//	if(y-1>=0&&x>=y-1&&y-1>=z)
//		sum(dp[x][y][z],dp[x][y-1][z]);
//	if(z-1>=0&&x>=y&&y>=z-1)
//		sum(dp[x][y][z],dp[x][y][z-1]);
//}
//void fun()
//{
//	int i,j,k;
//	memset(dp,0,sizeof(dp));
//	dp[0][0][0][0]=dp[0][0][0][1]=1;
//	for(i=1;i<=60;i++)
//		for(j=0;j<=i;j++)
//			for(k=0;k<=j;k++)
//			{
//				add(i,j,k);
//				if(i==j&&j==k)
//				{
//					cpy(num[i],dp[i][j][k]);
//					cout<<"{";
//					for(int ss=0;ss<=num[i][0];ss++)
//					{
//						cout<<num[i][ss];
//						if(ss!=num[i][0])
//							cout<<",";
//					}
//					cout<<"},";
//				}
//			}
//}
int main()
{
	//freopen("in.txt","w",stdout);
	//fun();
	int n;
	while(~scanf("%d",&n))
	{
		for(int i=num[n][0];i>0;i--)
		{
			printf("%d",num[n][i]);
		}
		printf("\n\n");
	}
}