2 人解决，6 人已尝试。
3 份提交通过，共有 22 份提交。
9.4 EMB 奖励。
2664. Super Domino
单点时限: 30.0 sec
内存限制: 256 MB
Look at the figure 1 below, you just tell me how many different ways can a n*m grid the given rectangle can be filled with small rectangles of size 2 times 1.
输入格式
The input file contains several test cases. Each test case is made up of two integer numbers: n and m, represent a n*m grid, (0 <= n, m <= 10^9, and Min{n, m} <= 7 )
输出格式
For each test case, output the number of different ways mod 9937.
样例
Input
1 2 1 3 1 4 2 2 2 3 2 4 2 11 4 11
Output
1 0 1 2 3 5 144 1520
创建: 14 年，8 月前.
修改: 6 年，8 月前.
最后提交: 14 年，7 月前.
来源: N/A
题目标签