Tiling
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 10540 | Accepted: 4906 |
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
The UofA Local 2000.10.14
高精度+递推。
递推公式:a[n]=2*a[n-2]+a[n-1]。画图琢磨一下就能推出来了。
编译器选C++,不然会出错。模板问题。
高精度+递推。
递推公式:a[n]=2*a[n-2]+a[n-1]。画图琢磨一下就能推出来了。
编译器选C++,不然会出错。模板问题。
#include<iostream>
#include<cstring>
using namespace std;
const int Base = 1000000000;
const int Capacity = 100;
typedef long long huge;
//直接套用大数模板
struct BigInt {//定义大数
int Len;
int Data[Capacity];
BigInt() : Len(0) {}
BigInt(const BigInt &V) : Len(V.Len) { memcpy(Data, V.Data, Len * sizeof*Data); }
BigInt(int V) : Len(0) { for (; V>0; V /= Base) Data[Len++] = V%Base; }
BigInt &operator=(const BigInt &V) { Len = V.Len; memcpy(Data, V.Data, Len * sizeof*Data); return *this; }
int &operator[] (int Index) { return Data[Index]; }
int operator[] (int Index) const { return Data[Index]; }
};
BigInt operator+(const BigInt &A, const BigInt &B) {//定义大数加法
int i, Carry(0);
BigInt R;
for (i = 0; i<A.Len || i<B.Len || Carry>0; i++) {
if (i<A.Len) Carry += A[i];
if (i<B.Len) Carry += B[i];
R[i] = Carry%Base;
Carry /= Base;
}
R.Len = i;
return R;
}
ostream &operator<<(ostream &Out, const BigInt &V) {//定义输出
int i;
Out << (V.Len == 0 ? 0 : V[V.Len - 1]);
for (i = V.Len - 2; i >= 0; i--) for (int j = Base / 10; j>0; j /= 10) Out << V[i] / j % 10;
return Out;
}
int main()
{
int n;
BigInt sum, a,b;
while (cin>>n)
{
int i = 0;
sum = 1;
a = 0;
b = 1;
while (i++!=n)
{
sum = a+ a+sum;//递推
a = b;
b = sum;
}
cout << sum << endl;
}
return 0;
}