Tri Tiling[HDU1143]

Tri Tiling

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1631    Accepted Submission(s): 928

Problem Description
In how many ways can you tile a 3xn rectangle with 2x1 dominoes? Here is a sample tiling of a 3x12 rectangle.

Input
Input consists of several test cases followed by a line containing -1. Each test case is a line containing an integer 0 ≤ n ≤ 30.

Output
For each test case, output one integer number giving the number of possible tilings.

Sample Input
2
8
12
-1

Sample Output
3
153
2131

Source
University of Waterloo Local Contest 2005.09.24

Recommend
Eddy

#include<stdio.h>
#include<string.h>
__int64 f[][];
int main()
{
    memset(f,,sizeof(f));
    f[][]=;
    f[][]=;
    f[][]=;
    f[][]=;
    f[][]=;
    f[][]=;
    f[][]=;
    f[][]=;
    int i;
    for (i=;i<=;i++)
    {
        if (i>=) f[i][]=f[i-][]+f[i-][]+f[i-][];
        f[i][]=f[i-][];
        f[i][]=f[i-][];
        f[i][]=f[i][]+f[i-][];
        f[i][]=f[i-][];
        f[i][]=f[i-][];
        f[i][]=f[i][]+f[i-][];
    }
    int n;
    while (scanf("%d",&n)!=EOF)
    {
        if (n==-) return ;
        printf("%I64d\n",f[n][]);
    }
    return ;
}