2 shunfurh shunfurh 于 2017.09.06 11:55 提问

Dominoes

Problem Description


Some day, Tom's father buys him a box of dominoes blocks. In the box, there are 12 different blocks, which are shown above. Tom is a boy who likes to do practice in intelligence, so he spends a whole afternoon in finishing two different rectangles with 3 * 20, which are shown below.

①⑤⑤⑤⑤⑨⑩⑩⑩⑥⑥⑧②②②②②③④④
①⑤⑿⑿⑨⑨⑨⑩⑥⑥⑦⑧⑧⑧⑾⑾③③③④
①①①⑿⑿⑿⑨⑩⑥⑦⑦⑦⑦⑧⑾⑾⑾③④④

①⑧⑦⑦⑦⑦⑥⑩⑨⑿⑿⑿②②②②②③④④
①⑧⑧⑧⑦⑥⑥⑩⑨⑨⑨⑿⑿⑤⑾⑾③③③④
①①①⑧⑥⑥⑩⑩⑩⑨⑤⑤⑤⑤⑾⑾⑾③④④

Tom is sure that these are the only solutions for 3 * 20, and he wants to know the number of solutions for 4 * 15, 5 * 12, ... Can you help him?

You should notice that if a solution will be the same as the other by some flip or rotate, these two solutions should be consider as the same.

Input
There may be several test cases. Each contains a single line with two positive integers M and N, which means the shape of M * N. Here M * N = 60.

Output
For each test case, output a line contains the number of solutions.

Sample Input
1 60
3 20

Sample Output
0
2

1个回答

caozhy
caozhy   Ds   Rxr 2017.09.20 23:43
已采纳
Csdn user default icon
上传中...
上传图片
插入图片
准确详细的回答,更有利于被提问者采纳,从而获得C币。复制、灌水、广告等回答会被删除,是时候展现真正的技术了!
其他相关推荐
poj1717 Dominoes (背包)
DominoesTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6665Accepted: 2211DescriptionA domino is a flat, thumbsized tile, the face of which is divided into two squares, each left blank or bear
uva 11270 - Tiling Dominoes(插头dp)
题目链接:uva 11270 - Tiling Dominoes 题目大意:用1∗2木块将给出的n∗m大小的矩阵填满的方法总数。 解题思路:插头dp的裸题,dp[i][s]表示第i块位置,并且该位置对应的行数的状态为s的时候的总情况数。0表示为竖放预留留的位置,1表示填上的位置,不管是竖放还是横放。并且第一位状态用滚动数组优化空间。 #include #include #incl
【POJ 1717】Dominoes(dp)
松墨初上,笔落纸签若雪我写满了一袭香
LeetCode 838 Push Dominoes
LeetCode 838 Push Dominoes 传送门 题目分析 There are N dominoes in a line, and we place each domino vertically upright. In the beginning, we simultaneously push some of the dominoes either to th...
Sicily 1527. Tiling a Grid With Dominoes
1527. Tiling a Grid With Dominoes Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description We wish to tile a grid 4 units high and N units long with rectangles (dominoes) 2 un
838. Push Dominoes 推托米诺骨牌
There are N dominoes in a line, and we place each domino vertically upright.In the beginning, we simultaneously push some of the dominoes either to the left or to the right.After each second, each dom...
hdu 5731 Solid Dominoes Tilings 插头dp+容斥原理
题意:给出一个n*m大小的棋盘,需要你用1*2的砖铺满它,砖不可重叠,并且要求棋盘上没有行分割线或列分割线。 输出方法种数。需要取模。
第九届山东省赛H题 Dominoes 【bfs广搜的应用】
贵有恒,何必三更起五更眠;最无益,莫过一日曝十日寒。6993: Dominoes时间限制: 1 Sec  内存限制: 128 MB提交: 45  解决: 20[提交][状态][讨论版][命题人:admin]题目描述Orz likes to play dominoes. Now giving an n*m chessboard and k dominoes whose size are 1*2, O...
3*1的骨骼牌排列
Tri Tiling(递归) Description In how many wayscan you tile a 3xn rectangle with 2x1 dominoes? Here is a sample tiling of a3x12 rectangle.    Input Input consistsof several test cases followed by
uva 11270 Tiling Dominoes 轮廓线DP
题意:给出一个n*m的棋盘(n*m 解:  若n        从上到下,从左往右,以每个格子为阶段,枚举能够达到该状态的前驱,进行状态转移。 实际铺设过程中该位置有几种情况:  1. 不铺: 如果该位置的上一层对应位置不为空 (该层左边随意) 2. 左铺: 如果前一位置为空,并且上层的该位置不为空。 3. 上铺: 如果上层该位置为空 (该层左边随意,会被底下的层处理掉