# 一个排列和排列组合的问题，没有思路了，如何利用C语言解决？？？

Problem Description
Dominoes are rectangular tiles with nice 2 × 1 and 1 × 2 sizes.

The tiling is called solid if it is not possible to split the tiled rectangle by a straight line, not crossing the interior of any tile. For example, on the picture below the tilings (a) and (b) are solid, while the tilings (c) and (d) are not.

Now the managers of the company wonder, how many different solid tilings exist for an m × n rectangle. Help them to find that out.

Input
The input file contains m and n(1≤m,n≤16).

Output
Output one integer number mod 1e9+7 - the number of solid tilings of m×n rectangle with 2 × 1 and 1 × 2 pavement tiles.

Sample Input
2 2
5 6
8 7

Sample Output
0
6
13514

• 写回答

#### 1条回答默认 最新

• threenewbee 2019-09-15 23:48
关注
本回答被题主选为最佳回答 , 对您是否有帮助呢?
评论

#### 悬赏问题

• ¥30 seata使用出现报错，其他服务找不到seata
• ¥35 引用csv数据文件（4列1800行），通过高斯-赛德尔法拟合曲线，在选取（每五十点取1点）数据，求该数据点的曲率中心。
• ¥20 程序只发送0X01,串口助手显示不正确,配置看了没有问题115200-8-1-no，如何解决？
• ¥15 Google speech command 数据集获取
• ¥15 vue3+element-plus页面崩溃
• ¥15 像这种代码要怎么跑起来？
• ¥15 安卓C读取/dev/fastpipe屏幕像素数据
• ¥15 pyqt5tools安装失败
• ¥15 mmdetection
• ¥15 nginx代理报502的错误