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.
Here is a sample tiling of a 2x17 rectangle.
![](https://i-blog.csdnimg.cn/blog_migrate/09098a4c7bc0e6dc5cb68974dc819f84.jpeg)
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
#include <stdio.h>
#include <stdlib.h>#include <string.h>
int main()
{
int n,x,t,i,p;
int arr[300][500];
while (scanf("%d",&n)!=EOF)
{
memset(arr,0,sizeof(arr));
arr[0][0]=1;
arr[1][0]=1;
arr[2][0]=3;
if(n==1||n==2||n==0)
printf("%d\n",arr[n][0]);
else
{
for (i=3;i<=n;i++)
{
p=0;
for (t=0;t<500;t++)
{
arr[i][t] = arr[i-1][t]+2*arr[i-2][t]+p;
p=arr[i][t]/10;
arr[i][t] %= 10; //存取每一位;
}
}
for (i=499;i>=0;i--)
{
if(arr[n][i]!=0)
{
for (;i>=0;i--) //输出每一位;
{
printf("%d",arr[n][i]);
}
}
}
printf("\n");
}
}
return 0;
}
#include<stdio.h>
#include<string.h>
int str[255][100];//储存大数据;
void fun()
{
str[0][0]=1;
str[1][0]=1;
str[2][0]=3;
int temp,i,j;
temp=0;
for(i=3;i<=250;i++)
{
for(j=0;j<100;j++)
{
temp+=(str[i-2][j])*2+str[i-1][j];
str[i][j]=temp%10;//存储每位数;
temp/=10;
}
}
}
int main()
{
fun();
int n;
while(scanf("%d",&n)!=EOF)
{
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");
}
}