BestCoder Round #50 (div.2)-----C The mook jong
2015-08-12 17:22
495 查看
The mook jong
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)
Problem Description
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
分析:找规律题,推导公式。最后得到的公式是ans[i]=ans[i-3]+1+ans[i-1]。
CODE:
#include <iostream> using namespace std; int main() { int n; long long ans[66]={0,1,2,3}; for(int i=4;i<66;i++){ ans[i]=ans[i-3]+1+ans[i-1]; } while(cin>>n){ cout<<ans <<endl; } return 0; }
相关文章推荐
- 什么是行式数据库,什么是列式数据库
- Ibatis相关基础之一-为什么要用sqlMapClientTemplate
- 黑马程序员——面向对象(构造函数+构造代码块)-第10天
- 配置struts出现404错误
- selenium grid2 - node说明
- Android开发工具汇总
- 人件札记:人血馒头
- LM**项目开发感悟
- 【4】优化一下【3】的例子,顺便说说细节
- ASP与ASP.NET的优势与不足
- ReactiveCocoa学习(二)
- cart剪枝,罚项系数a讨论
- 【Python】[高级特性]切片,迭代,列表生成式,生成器,迭代器
- Ruby中如何复制对象 (deep clone)(转载)
- HTTP协议--状态码
- Hdu 5372 Segment Game (树状数组)
- [ASM]Linux x86_64平台汇编实例
- 鱼c论坛常用工具
- HDU 1258 Sum It Up (DFS)
- 【bzoj1193】[HNOI2006]马步距离