Tiling POJ 2506

最新推荐文章于 2017-03-29 20:31:43 发布

Sunmh_AC

最新推荐文章于 2017-03-29 20:31:43 发布

阅读量456

点赞数

分类专栏： POJ 大数模拟递推&&递归

本文链接：https://blog.csdn.net/Sunmh_AC/article/details/47981597

版权

这篇博客介绍了如何使用递推和高精度运算解决POJ 2506题目，内容涉及长题目的解析和解题思路。

摘要由CSDN通过智能技术生成

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

关注

专栏目录