Tiling
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 7364 | Accepted: 3591 |
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.
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
题意:
有2*2和2*1的两种地板砖,现在要在2*n的地板上铺地板砖,问一共有多少种方法。
思路:
当n等于0时,有一种方法,就是不铺地板砖。
当n等于1时,有一种方法,就是铺一块2*1的地板砖。
当n等于2时,有3种方法,用一块2*2的地板砖,用两块2*1的地板砖(分别横着并排铺和竖着并排铺)。
当n等于3时,有5种方法,1):在n等于2的基础上,加一块2*1的地板砖,可以有3种方法。2):在n等于1的基础上,加一块2*2的地板砖或是加两块2*1的地板砖。
由此可见,规律为a[i] = a[i-1] + 2 * a[i - 2];
由于数据比较大,所以用大数来计算,这是我第二次写大数啊!!
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
using namespace std;
int ss[259][2000];
int fz[3000];
int main()
{
int i,j,k,y,m,s,p;
ss[0][1] = 1;
ss[1][1] = 1;
for(i = 2; i <= 250; i++)
{
s = 0;
for(k = 1;k <= 1000;k++)
{
s = ss[i-2][k] + ss[i-2][k] + s;
if(s >= 10)
{
fz[k] = s % 10;
s = s/10;
}
else
{
fz[k] = s;
s = 0;
}
}
j = 0;
for(k = 1;k <= 1000;k++)
{
j = ss[i-1][k] + fz[k] + j;
if(j >= 10)
{
ss[i][k] = j % 10;
j = j / 10;
}
else
{
ss[i][k] = j;
j = 0;
}
}
}
while(~scanf("%d",&m))
{
for(i = 1000;; i--)
{
if(ss[m][i] != 0)
break;
}
for(; i>0; i--)
{
printf("%d",ss[m][i]);
}
printf("\n");
}
return 0;
}