HDU 1143
来源:互联网 发布:mac quick time 编辑:程序博客网 时间:2024/06/16 12:02
Tri Tiling
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2764 Accepted Submission(s): 1559
Problem Description
In how many ways can you tile a 3xn rectangle with 2x1 dominoes? Here is a sample tiling of a 3x12 rectangle.
![](http://acm.hdu.edu.cn/data/images/1143-1.jpg)
![](http://acm.hdu.edu.cn/data/images/1143-1.jpg)
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
#include<stdio.h>using namespace std;int n;long long dp[32];int main(){ dp[0] = 1; dp[2] = 3; dp[4] = 11; for(int i = 6; i < 32; i+=2) dp[i] = 3*dp[i-2] + dp[i-2] - dp[i-4]; while(~scanf("%d",&n)) { if(-1 == n) break; printf("%lld\n",dp[n]); } return 0;}
0 0
- hdu 1143
- HDU 1143
- HDU 1143
- hdu 1143 递推
- hdu 1143 Tri Tiling
- hdu 1143 递归
- hdu 1143 数学
- hdu 1143 Tri Tiling
- hdu 1143 Tri Tiling
- hdu-1143-Tri Tiling
- hdu 1143 Tri Tiling
- HDU 1143 Tri Tiling
- HDU 1143 Tri Tiling
- HDU 1143 Tri Tiling
- HDU 1143 Tri Tiling
- HDU 1143 Tri Tiling
- hdu 1143 技巧
- hdu
- Makefile -fPIC 选项
- hdu 1717 小数化分数2
- STL LIST链表的使用 C++
- 计算几何模板
- hdu3076ssworld VS DDD 概率dp
- HDU 1143
- Android Application详解
- 笨鸟先飞之Java(一)--使用struts2框架实现文件上传
- NOI 97 积木游戏
- 二叉搜索树【BST】c++实现
- 集合容器对比
- 同一进程下线程共享的数据和独有的数据
- 自定义Application的未捕获异常处理
- 对称加密算法和非对称加密算法速度对比