poj 2506 Tiling

来源：互联网发布：阿玛尼手表淘宝编辑：程序博客网时间：2024/05/17 02:57

Tiling

Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7461 Accepted: 3645

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

Source

The UofA Local 2000.10.14

大数递归直接用java打表就行了

import java.math.BigInteger;import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner cin=new Scanner(System.in);BigInteger[] ans=new BigInteger[300];ans[0]=BigInteger.ONE;ans[1]=BigInteger.ONE;int n;for(int i=2;i<ans.length;i++)ans[i]=(ans[i-1].add(ans[i-2])).add(ans[i-2]);while(cin.hasNext()){     n=cin.nextInt();System.out.println(ans[n]);}}}

0 0