本文共 1104 字,大约阅读时间需要 3 分钟。
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.
OutputFor each line of input, output one integer number in a separate line giving the number of possible tilings of a 2xn rectangle.
Sample Input2
8 12 100 200 Sample Output3
171 2731 845100400152152934331135470251 1071292029505993517027974728227441735014801995855195223534251给2x1和2x2的地板,求铺成2xn的面积有多少种排列方式
网上找的,都是大神,真的。说什么a[n]=a[n-1]+2*a[n-2],反正我是没看出来#include#include #include using namespace std;string a[300];string Add(string s1,string s2){ if (s1.length() =0;i--,j--) { s1[i]=s1[i]+(j>=0?s2[j]-'0':0); if(s1[i]-'0'>=10) { s1[i]=(s1[i]-'0')%10+'0'; if(i) s1[i-1]++; else s1='1'+s1; } } return s1;}int main(){ int i,n; a[0]="1",a[1]="1",a[2]="3"; for (i=3; i<=250; i++) a[i]=Add(Add(a[i-1],a[i-2]),a[i-2]); while (cin>>n) cout< <
转载地址:http://htcvb.baihongyu.com/