poj2663 Tri Tiling dp递推

qiqijianglu

于 2012-10-17 16:34:09 发布

阅读量4.1k

点赞数 1

分类专栏： dp 文章标签： integer output each input

本文链接：https://blog.youkuaiyun.com/qiqijianglu/article/details/8082042

版权

这篇博客详细介绍了如何解决POJ2663编程题——Tri Tiling，主要通过动态规划（dp）的方法进行递推求解，探讨了输入输出格式及样例分析。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Tri Tiling

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6314		Accepted: 3370

Description

In how many ways can you tile a 3xn rectangle with 2x1 dominoes?
Here is a sample tiling of a 3x12 rectangle.

Input

Input consists of several test cases followed by a line containing -1. Each test case is a line containing an integer 0 <= n <= 30.

Output

For each test case, output one in