Tiling
Time limit:1000 ms |
|
Memory limit:65536 K |
Total submissions:7454 |
|
Accepted:3640 |
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
2812100200
Sample output
317127318451004001521529343311354702511071292029505993517027974728227441735014801995855195223534251
import java.math.BigInteger;import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner cin=new Scanner(System.in);BigInteger []a=new BigInteger[10000];a[0]=BigInteger.ONE;a[1]=BigInteger.ONE;for(int i=2;i<=300;i++){a[i]=a[i-1].add(a[i-2].multiply(BigInteger.valueOf(2))); //a[i]=a[i-1]+2*a[i-2]}int n;while(cin.hasNext()){ n=cin.nextInt(); System.out.println(a[n]);}}}