首页 > 代码库 > I - Tri Tiling
I - Tri Tiling
1 #include<cstdio> 2 using namespace std; 3 int f(int n) 4 { 5 if(n==0) 6 return 1; 7 if(n==2) 8 return 3; 9 else10 return 4*f(n-2)-f(n-4);11 }12 int main()13 {14 int n;15 while(scanf("%d",&n)==1&&n!=-1)16 if(n%2==0)17 printf("%d\n",f(n));18 else19 printf("%d\n",0);20 return 0;21 }
Description
In how many ways can you tile a 3xn rectangle with 2x1 dominoes? 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
2812-1
Sample Output
31532131
DP!
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。