首页 > 代码库 > poj 2663 Tri Tiling
poj 2663 Tri Tiling
Tri Tiling
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 7887 | Accepted: 4134 |
Description
In how many ways can you tile a 3xn rectangle with 2x1 dominoes?
Here is a sample tiling of a 3x12 rectangle.
Here is a sample tiling of a 3x12 rectangle.
Input
Input consists of several test cases followed by a line containing -1. Each test case is a line containing an integer 0 <= n <= 30.
Output
For each test case, output one integer number giving the number of possible tilings.
Sample Input
2 8 12 -1
Sample Output
3 153 2131
题解：a[i]=4*a[i-2]-a[i-4];
#include <iostream>
using namespace std;
int main(){
long long n,a[50];
a[0]=1;a[2]=3;
for(int i=4;i<=30;i+=2)
a[i]=4*a[i-2]-a[i-4];
while (cin>>n&&n!=-1){
if (n%2)
cout<<0<<endl;
else
cout<<a[n]<<endl;
}
return 0;
}poj 2663 Tri Tiling
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。