POJ2506，Tiling

最新推荐文章于 2019-05-02 21:15:07 发布

ieayoio

最新推荐文章于 2019-05-02 21:15:07 发布

阅读量1.2k

点赞数 1

分类专栏：水 OJ 文章标签： java 大数递推

本文链接：https://blog.csdn.net/ieayoio/article/details/38261923

版权

OJ 同时被 2 个专栏收录

64 篇文章 1 订阅

订阅专栏

水

18 篇文章 0 订阅

订阅专栏

Tiling

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7528		Accepted: 3682

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

Sample Output

3
171
2731
845100400152152934331135470251
1071292029505993517027974728227441735014801995855195223534251

Source

The UofA Local 2000.10.14

import java.math.BigInteger;
import java.util.Arrays;
import java.util.Scanner;


public class poj2506 {
	public static void main(String[] args) {
		Scanner cin=new Scanner(System.in);
		BigInteger []f= new BigInteger[260];
		Arrays.fill(f, BigInteger.ZERO);
		f[0]=BigInteger.ONE;
		for (int i=0;i<=250;i++){
			f[i+1]=f[i+1].add(f[i]);
			f[i+2]=f[i+2].add((f[i].multiply(BigInteger.valueOf(2))));
		}
		while (cin.hasNext()){
			int n=cin.nextInt();
			System.out.println(f[n]);
		}
	}

}

java大数递推水过，递推f[i+1]和f[i+2]

题目大意:2xn的矩形用2x1和2x2两种矩形填充，一共有多少种填充方案