BestCoder Round #50 (div.2) & HDOJ5366 The mook jong(dp)
2015-08-09 10:37
375 查看
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
Sample Output
简单的dp 一下就被田神秒了= = 注意long long
AC代码:
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
简单的dp 一下就被田神秒了= = 注意long long
AC代码:
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int maxn = 65; int n; long long dp[maxn]; int main() { dp[1] = 1, dp[2] = 2, dp[3] = 3, dp[4] = 5; for(int i = 5; i <= 60; ++i) dp[i] = dp[i- 1] + dp[i - 3] + 1; while(scanf("%d", &n) != EOF) printf("%I64d\n", dp ); return 0; }
相关文章推荐
- dp跟px的互相转换
- 编码剖析Spring装配基本属性的原理
- Android 控件自动换行
- UiAutomator环境搭建及详细操作
- 机器学习之logistic分类线性与非线性实验(续)
- C语言:整体运行流程
- H-index因素
- 正则表达式
- HDU 5364 Distribution money 模拟
- hdu 4931 /BC 4A Happy Three Friends
- FFmpeg库 32位和64位
- node.js中同步和异步共同使用时应额外注意
- iBeacon技术解析:苹果对抗NFC的利器
- 变量的注意事项
- c++动态内存分配与释放
- 有个库 snbcg ,加了宽字符版,lib和dll更名成snbcgu.lib snbcgu.dll
- JAVA环境变量配置
- 分数相加减(c++)
- 利用指针求最值
- 面向对象的数据库db4o: 初识db4o