POJ 2506-Tiling(递推+大数)

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

Output

Sample Input

2
8
12
100
200

Sample Output

3
171
2731
845100400152152934331135470251
1071292029505993517027974728227441735014801995855195223534251

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
char a[310][120];
int main()
{
        int n,i,j;
        memset(a,'0',sizeof(a));
        a[0][0]='1';
        a[1][0]='1';
        a[2][0]='3';
        for(i=3; i<=250; i++)
        {
                for(j=0; j<110; j++)
                {
                        int sum=2*(a[i-2][j]-'0')+a[i-1][j]-'0'+a[i][j]-'0';
                        a[i][j]=sum%10+'0';
                        a[i][j+1]=sum/10+'0';
                }
        }
        while(~scanf("%d",&n))
        {
                int flag=0;
                for(i=110; i>=0; i--)
                        if(a[n][i]!='0')
                        {
                                flag=i;
                                break;
                        }
                for(i=flag; i>=0; i--)
                        printf("%c",a[n][i]);
                printf("\n");
        }
        return 0;
}

POJ 2506-Tiling(递推+大数)

原文：http://blog.csdn.net/u013486414/article/details/42486759