Foj 1147 Tiling
来源:互联网 发布:eclipse php开发 编辑:程序博客网 时间:2024/05/16 01:28
Accept: 233 Submit: 575
Time Limit: 1000 mSec Memory Limit : 32768 KB
Problem Description
In how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles?
Here is a sample tiling of a 2x17 rectangle.
Input
Input is a sequence of lines, each line containing an integer number 0 <= n <= 250.
Output
For each line of input, output one integer number in a separate line giving the number of possible tilings of a 2xn rectangle.
Sample Input
2
8
12
Sample Output
3
171
2731
big[i]=big[i-1]+big[i-2]*2
菜鸟的做法, java.....
- Foj 1147 Tiling
- FOJ 1147 Tiling
- Foj 1147 Tiling[ dp+高精度 ]
- FOJ 2040 Tiling
- FZU 1147 Tiling
- Tiling
- Tiling
- Tiling
- Tiling
- Tiling
- Tiling
- Tiling
- FZU- Problem 1147 Tiling,递推坑题,大数水过~~
- Tri Tiling
- Tri Tiling
- Tiling(P2506)
- Tri Tiling
- Tri Tiling
- Tomcat 安装服务错误之 【NonAlpha 95 】
- java并发编程实践 笔记(1)
- Linux编译Boost_1_41_0
- jQuery-toggle()与toggle(fn,fn)的用法
- UNDO 行为
- Foj 1147 Tiling
- Scala开发环境搭建
- 加入页眉、页尾
- eth0,eth1,eth2,lo是什么
- tal切换
- java面试题,质数求和
- 为什么要开此blog
- [转] 那个叫鲁迅的人终于从教科书里滚蛋了 收藏
- 新版本MyCP正式上线