HDU 5366
来源:互联网 发布:网络恐怖主义解释 编辑:程序博客网 时间:2024/04/29 17:19
The mook jong
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 326 Accepted Submission(s): 252
Problem Description
![](../../data/images/C613-1001-1.jpg)
ZJiaQ want to become a strong man, so he decided to play the mook jong。ZJiaQ want to put some mook jongs in his backyard. His backyard consist of n bricks that is 1*1,so it is 1*n。ZJiaQ want to put a mook jong in a brick. because of the hands of the mook jong, the distance of two mook jongs should be equal or more than 2 bricks. Now ZJiaQ want to know how many ways can ZJiaQ put mook jongs legally(at least one mook jong).
Input
There ar multiply cases. For each case, there is a single integer n( 1 < = n < = 60)
Output
Print the ways in a single line for each case.
Sample Input
1
2
3
4
5
6
Sample Output
1
2
3
5
8
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 326 Accepted Submission(s): 252
Problem Description
![](../../data/images/C613-1001-1.jpg)
ZJiaQ want to become a strong man, so he decided to play the mook jong。ZJiaQ want to put some mook jongs in his backyard. His backyard consist of n bricks that is 1*1,so it is 1*n。ZJiaQ want to put a mook jong in a brick. because of the hands of the mook jong, the distance of two mook jongs should be equal or more than 2 bricks. Now ZJiaQ want to know how many ways can ZJiaQ put mook jongs legally(at least one mook jong).
Input
There ar multiply cases. For each case, there is a single integer n( 1 < = n < = 60)
Output
Print the ways in a single line for each case.
Sample Input
1
2
3
4
5
6
Sample Output
1
2
3
5
8
12
#include <stdio.h>__int64 a[61];int main(){ a[1]=1; a[2]=2; a[3]=3; for(int i=4;i<61;i++) { a[i]=a[i-1]+a[i-3]+1; } int n; while(~scanf("%d",&n)) { printf("%I64d\n",a[n]); } return 0;}
0 0
- HDU 5366
- hdu-5366
- hdu 5366 排列组合
- HDU 5364 5366
- hdu 5366(排列组合)
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- 普通型母函数模板理解
- hdu 2874 lca-tarjan离线算法(模板)
- 第一周工作周报-5
- Java文件删除问题
- java使用dbcp操作数据库的用法
- HDU 5366
- HDU-2871 Flood-it!(IDA*)
- Spring注解
- 机房收费系统重构——Datatable转泛型
- Ruby操作数据时需要掌握的基础知识
- PyQt5初级教程--PyQt5中的拖放[10/13]
- unbuntu下如何更新adobe flash插件
- HDU 2444
- Android四大组件之三:ContentProvider数据共享