FOJ 1147 Tiling

spongewxy

于 2015-06-01 22:37:15 发布

阅读量453

点赞数

分类专栏： FOJ

本文链接：https://blog.csdn.net/XDU_PYL/article/details/46318043

版权

FOJ 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

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


public class Main {
	
	/*
	 * 很容易得到相应的递推公式:f[n] = f[n-1] + 2 * f[n-2]
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		BigInteger[] dp = new BigInteger[255];
		dp[0] = new BigInteger("1");
		dp[1] = new BigInteger("1");
		for(int i = 2; i <= 250; ++i) {
			dp[i] = new BigInteger("0");
		}
		for(int i = 2; i <= 250; ++i) {
			dp[i] = dp[i].add(dp[i-1]);
			dp[i] = dp[i].add(dp[i-2]);
			dp[i] = dp[i].add(dp[i-2]);
		}
		int n;
		Scanner cin = new Scanner(System.in);
		while(cin.hasNext()) {
			n = cin.nextInt();
			System.out.println(dp[n]);
		}
	}

}