POJ 2506

Tiling

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7255		Accepted: 3528

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

 

好久没有写大数了 出了好多细节性的问题 恶心的要死啊 

而且一开始公式推错了

正确公式应该是f(n)=f(n-1)+2*f(n-2);

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <ctype.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <string>
#include <vector>

using namespace std;

int main()
{
    int num[251][301];
    memset(num,0,sizeof(num));
    num[0][0]=1;
    num[1][0]=1;
    for(int i=2; i<=250; i++)
    {
        for(int j=0; j<300; j++)
            num[i][j]=num[i-1][j]+2*num[i-2][j];
        for(int j=0; j<300; j++)
        {
            if(num[i][j]>=10)
            {
                num[i][j+1]+=num[i][j]/10;
                num[i][j]%=10;
            }
        }
    }
    int n;
    while(cin>>n)
    {
        int c=0;
        for(int i=300; i>=0; i--)
            if(num[n][i]!=0)
            {
                c=i;
                //cout<<"c "<<c<<endl;
                break;
            }
        for(int j=c; j>=0; j--)
            cout<<num[n][j];
        cout<<endl;
    }
    return 0;
}