Tiling 2506 （打表+大数+递推）

Tiling

Description

In how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles?

Here is a sample tiling of a 2x17 rectangle.

Input

Input is a sequence of lines, each line containing an integer number 0 <= n <= 250.

Output

For each line of input, output one integer number in a separate line giving the number of possible tilings of a 2xn rectangle.

Sample Input

28
12
100
200

Sample Output

3171
2731
845100400152152934331135470251
1071292029505993517027974728227441735014801995855195223534251

#include<stdio.h>
#include<string.h>
int a[251][101];
int main()
{	
	int n,m,i,j;
	a[0][100]=0;
	a[1][100]=1;
	a[2][100]=3;
	for(i=3;i<=250;i++)
	{
		for(j=100;j>=0;j--)
		{
			a[i][j]+=a[i-1][j]+2*a[i-2][j];
			if(a[i][j]>=10)
			{
				a[i][j-1]+=a[i][j]/10;
				a[i][j]%=10;
			}
		}
	}
	while(scanf("%d",&n)!=EOF)
	{
		if(n==0||n<0||n>250)//这块太坑了（WA了十几次） 
			printf("1\n");
		else
		{
			for(i=0;i<=100;i++)
				if(a[n][i]!=0)
					break;
			m=i;
			for(j=m;j<=100;j++)
				printf("%d",a[n][j]);
				printf("\n");
		}
	}
	return 0;
}