M3TILE - LATGACH3
题意翻译
有多少种方法可以用2x1多米诺骨牌拼贴3xn矩形?
这是一个3x12矩形的样本平铺。
输入包含几个测试用例,后跟一个-1。每个测试用例是一个包含整数0<n≤30的行。对于每个测试用例,输出一个整数,给出可能的数量。
题目描述
[English](/problems/M3TILE/en/) [Vietnamese](/problems/M3TILE/vn/) ```
In how many ways can you tile a 3xn rectangle with 2x1 dominoes?
Here is a sample tiling of a 3x12 rectangle.
Input consists of several test cases followed by a line containing -1.
Each test case is a line containing an integer 0 ≤ n ≤ 30. For each test
case, output one integer number giving the number of possible tilings.
```
![](https://cdn.luogu.com.cn/upload/vjudge_pic/SP3883/fb1fb30813f232fa0a05a612248018fbf7ec441a.png)