Expert as he was in this material, he saw at a glance that he'll need a computer to calculate the number of ways to fill the large rectangle whose dimensions were integer values, as well. Help him, so that his dream won't turn into a nightmare!
2546: Mondriaan's Dream
| Time Limit | $1$ 秒/Second(s) | Memory Limit | $512$ 兆字节/Megabyte(s) |
| 提交总数 | $5$ | 正确数量 | $4$ | "
| 裁判形式 | 标准裁判/Standard Judge | 我的状态 | 尚未尝试 |
| 难度 | 分类标签 | 动态规划 |
Description
Squares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his 'toilet series' (where he had to use his toilet paper to draw on, for all of his paper was filled with squares and rectangles), he dreamt of filling a large rectangle with small rectangles of width 2 and height 1 in varying ways.
Input
The input contains several test cases. Each test case is made up of two integer numbers: the height h and the width w of the large rectangle. Input is terminated by h=w=0. Otherwise, 1<=h,w<=11.
Output
For each test case, output the number of different ways the given rectangle can be filled with small rectangles of size 2 times 1. Assume the given large rectangle is oriented, i.e. count symmetrical tilings multiple times.
Sample Input复制
1 2
1 3
1 4
2 2
2 3
2 4
2 11
4 11
0 0
Sample Output复制
1
0
1
2
3
5
144
51205
推荐代码 查看2546 所有题解 上传题解视频得图灵币
| 本题记录 | 用 户（点击查看用户） | 运行号（点击购买题解） | 时 间 |
|---|---|---|---|
| 算法最快[$0 $ms] | 计爱玲 | 202260 | 2018-02-24 22:13:35 |
| 内存最少[$0 $KB] | 淡意的温柔 | 606114 | 2020-07-08 10:44:28 |
| 第一AC | 计爱玲 | 202260 | 2018-02-24 22:13:35 |
| 第一挑战 | 计爱玲 | 202260 | 2018-02-24 22:13:35 |
赛题来源/所属竞赛 NA N/A
| 竞赛编号 | 竞赛名称 | 竞赛时间 | 访问比赛 |
|---|