2506 Tiling 递推 大数

Tiling

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5316		Accepted: 2583

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

/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/

/**
*
* @author Administrator
*/
import java.util.*;
import java.math.*;
public class Main {

/**
* @param args the command line arguments
*/
public static void main(String[] args) {
// TODO code application logic here
Scanner cin=new Scanner(System.in);
int n;
BigInteger []f=new BigInteger[301];
f[0]=BigInteger.valueOf(1);
f[1]=BigInteger.valueOf(1);
f[2]=BigInteger.valueOf(3);
for(int i=3;i<300;i++)
{
f[i]=f[i-1].add(f[i-2].multiply(BigInteger.valueOf(2)));
}
while(cin.hasNext())
{
n=cin.nextInt();
System.out.println(f
);
}
}

}