HDOJ--1143--Tri Tiling

题目描述：
In how many ways can you tile a 3xn rectangle with 2x1 dominoes? Here is a sample tiling of a 3x12 rectangle.
输入描述:
Input consists of several test cases followed by a line containing -1. Each test case is a line containing an integer 0 ≤ n ≤ 30.
输出描述:
For each test case, output one integer number giving the number of possible tilings.
输入：
2
8
12
-1
输出：
3
153
2131
题意：
递推
题解：
递推
代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

typedef long long ll;
ll f[50];
void init(){
    f[0] = 1;
    f[2] = 3;
    for(int i = 4; i <= 30; i ++){
        if(i %2  == 1) f[i] = 0;
        f[i] = f[2] * f[i - 2];
        for(int j = i - 4; j >= 0; j -= 2){
			f[i] += 2 * f[j];
		}
    }
}

int main(){
    int n;
    init();
    while(scanf("%d",&n)!=EOF){
        if(n == - 1) break;
        printf("%I64d\n",f[n]);
    }
    return 0;
}