[POJ2411]Mondriaan\'s Dream

Grade Open Time Friday, 19 September 2014, 10:08 am
Discount 0.8 Time Discount Friday, 26 September 2014, 10:08 am
Allow late Yes Close Time Friday, 26 September 2014, 10:08 am
Input file examfive.in Output file examfive.out

【题目描述】

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.

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!

【输入格式】

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.

【输出格式】

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.

【中文题意】


给出h*w(1≤h、w≤11)的方格棋盘,用1*2 的长方形骨牌不重叠地覆盖这个

棋盘,求覆盖满的方案数。

输入文件包含多组数据。

每组数据有一行,两个正整数h,w。

输入结束标志为h=w=0.

对每组数据,输出一行一个正整数,即方案总数。


【样例输入】

1 2
1 3
1 4
2 2
2 3
2 4
2 11
4 11
0 0

【样例输出】

1
0
1
2
3
5
144
51205

【提示】

【来源】

【题目来源】

北京大学 POJ 2411