hdoj 1143 Tri Tiling 【递推】
来源:互联网 发布:vb.net加载dll 编辑:程序博客网 时间:2024/05/01 09:35
Tri Tiling
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2856 Accepted Submission(s): 1618
Problem 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
/*题意:用2*1的小矩形有几种方法摆出3*n的大矩形.a[0] = 1,a[1]=0,a[2]=3,a[3]=0,只要n是奇数a[n]=0递推 a[n] = 4*a[n-2]-a[n-4];*/#include<stdio.h>#include<string.h>int a[33];int main(){int i,j,n;a[0] = 1;a[1] = 0;a[2] = 3;a[3] = 0;for(i = 4; i < 33;i++)a[i] = 4*a[i-2] - a[i-4];while( scanf("%d",&n),n!=-1)printf("%d\n",a[n]);return 0;}
0 0
- hdoj 1143 Tri Tiling 【递推】
- 1143Tri Tiling --递推
- Tri Tiling+递推
- 递推:Tri Tiling
- hdoj 1143-Tri Tiling
- hdu 1143 Tri Tiling 递推
- HDU 1143 Tri Tiling 【递推】
- 【数学 递推】 HDU 1143 Tri Tiling
- HDU 1143 Tri Tiling (递推)
- HDU 1143 Tri Tiling(递推)
- hdu1143 Tri Tiling 递推
- HDU1143 Tri Tiling 递推
- Tiling ,Tri Tiling(递推)
- dp专辑 E - Tri Tiling [递推]
- poj2663 Tri Tiling dp递推
- poj 2663 Tri Tiling(递推)
- hdu1143 Tri Tiling(数学:递推)
- Tri Tiling 递推数组解
- 子父类中构造函数的特点
- zoj-2112(主席树动态求区间第k小数)
- UVA 11354 Bond(最小生成树+lca+倍增求祖先节点)
- 页面更新的问题
- 一次被黑追凶(未完待续)
- hdoj 1143 Tri Tiling 【递推】
- 链接MapReduce作业http://user.qzone.qq.com/1178772762/blog/1440417746
- Windows内核编程基础篇之字符串的拷贝
- Hbase优化
- 设置异常向量表
- 跟我一起写Makefile:书写规则
- Java输入输出流的使用详细介绍
- Sorageinfo类获得Android设备上挂载的所有存储器状态
- Android4.3 蓝牙BLE初步