POJ-2506-Tiling

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

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

#include <stdio.h>
#include <stdlib.h>

int i,j,x,a[1000][1000];

int main()
{
    a[1][0]=1;
    a[2][0]=3;
    for (i=3; i<=250; i++)
    {
        for (j=0; j<300; j++)
        {
            a[i][j]+=a[i-2][j]*2+a[i-1][j];
            if (a[i][j]>9)
            {
                a[i][j+1]=a[i][j]/10;
                a[i][j]=a[i][j]%10;
            }
        }
    }
    int n;
    while (~scanf ("%d",&n))
    {
        if (n==0)
        {
            printf ("1\n");
            continue ;
        }
        for (i=999; i>=0; i--)
            if (a[n][i]!=0)
                break;
        for (j=i; j>=0; j--)
            printf ("%d",a[n][j]);
        printf ("\n");
    }
    return 0;
}