Tiling
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 10678 | Accepted: 4975 |
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.
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
题目解析:
这个题目的意思很简单,就是你现在有三种规格的地砖,然后铺完地面,一共有多少种情况,解析回去细细写一下,大数运算,直接上java
代码:
import java.math.BigInteger;
import java.util.Scanner;
public class Main {
private static Scanner in;
public static void main(String[] args) {
BigInteger dp[] = new BigInteger[300];
dp[0] = BigInteger.valueOf(1);
dp[1] = BigInteger.valueOf(1);
dp[2] = BigInteger.valueOf(3);
for(int i = 3;i<300;i++)
dp[i] = dp[i-1].add(dp[i-2].multiply(BigInteger.valueOf(2)));
in = new Scanner(System.in);
while(in.hasNext())
{
System.out.println(dp[in.nextInt()]);
}
}
}