Tiling

Tiling

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9378		Accepted: 4467

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

Source

The UofA Local 2000.10.14
这个题我想公式大家都可以推出来，主要是关于大数的处理，大家需要掌握

#include<stdio.h>
#include<string.h>
int str[300][300];
void f()
{
	str[0][0] = 1;
	str[1][0] = 1;
	str[2][0] = 3;
	int temp = 0;
	for(int i = 3;i <= 250;i++)
	{
		temp = 0;
		for(int j = 0;j < 100;j++)
		{
			temp = temp + str[i-2][j]*2 + str[i-1][j];
			str[i][j] = temp%10;
			temp = temp/10;
		}
	}
}
int main()
{
	f();
	int n;
	while(~scanf("%d",&n))
	{
		int i;
		for( i = 99;i >= 0;i--)
		{
			if(str[n][i] != 0)
				break;
		}
		for(;i >= 0;i--)
		{
			printf("%d",str[n][i]);
		}
		printf("\n");
	}
	return 0;
}