Tiling
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 7457 | Accepted: 3642 |
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.
![](https://i-blog.csdnimg.cn/blog_migrate/09098a4c7bc0e6dc5cb68974dc819f84.jpeg)
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
Source
思路:递归加高精度;题目比较简单,就是问你用2*1和2*2的方块能有几种方法组合成2*n
递归 公式很容易得到,看图,我们可以假设当n=3时,方格组合可以有一个2*2和一个2*1的方式组合
当把2*1单独出来时,它一种组合方式,就是竖就一种。然后旁边就是一个2*2的方式。设当n=3时,设方法数为f(3)。
当只放入2*1方格时,方法就是2*1的方法,但是前面2*2用2*1有两种摆放方式就是横着和竖着。所以应该是2*f(1)
当推广到n时方法f(n)=f(n-1)+2*f(n-2);然后高精度的话我有两张方法,第一种就是用一个二维数组把数存起来,当数大于十时,就后面进一。然后我用的是java的高精度,推荐java吧
import java.math.BigInteger;
import java.util.Scanner;
public class qq {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
BigInteger a, b, c, d;
c = BigInteger.ZERO;
int i;
int n ;
while (cin.hasNext()) {
a = BigInteger.valueOf(1);
b = BigInteger.valueOf(3);
c = BigInteger.ZERO;
n = cin.nextInt();
if (n == 1||n==0) {
c = a;
System.out.println(c);
} else if (n == 2) {
c = b;
System.out.println(c);
} else {
for (i = 3; i <= n; i++) {
c = b.add(a.multiply(BigInteger.valueOf(2)));
a=b;
b=c;
}
System.out.println(c);
}
}
}
}