POJ2506 Tiling 【大数和】

Tiling

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 8041		Accepted: 3898

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

2
8
12
100
200

Sample Output

3
171
2731
845100400152152934331135470251
1071292029505993517027974728227441735014801995855195223534251

找规律 :  f(0) = 1, f(1) = 1, f(n) = f(n-1) + 2 * f(n-2).

#include<stdio.h>
#include<string.h>
int num[255][100]={{1},{1},{3}};
int temp[100];
void f()
{
	int i,j,k;
	int s,c;
	for(i=2;i<255;i++)
	{
		for(j=0,c=0;j<100;j++)
		{
			s=num[i-1][j]+num[i-2][j]+num[i-2][j]+c;
			num[i][j]=s%10;
			c=(s-num[i][j])/10;
		}
	}
}
int main()
{
	int n;
	int i,j;
	f();
	while(scanf("%d",&n)!=EOF)
	{
		for(i=99;num[n][i]==0;i--)
			;
		for(;i>=0;i--)
		{
			printf("%d",num[n][i]);
		}
		printf("\n");
	}
	return 0;
}