HDU 5366 The mook jong(递推)
来源:互联网 发布:java写一个简单的接口 编辑:程序博客网 时间:2024/04/30 03:49
The mook jong
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 365 Accepted Submission(s): 283
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).
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
123456
Sample Output
12358121*n的格子 ,每个格子可以放一个木人桩,相邻的木人桩最少隔 两个格子 ,求至少放一个木人桩的不同放法数f[i] = f[i-1] + f[i-3] + 1#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>#include <stdlib.h>#include <cmath>#include <map>#include <queue>#define inf 0x3f3f3f3fusing namespace std;int main(){ __int64 b[65]; b[1]=1; b[2]=2; b[3]=3; for(int i=4;i<=60;i++) { b[i]=b[i-1]+b[i-3]+1; } int n; while(~scanf("%d",&n)) { printf("%I64d\n",b[n]); } return 0;}
0 0
- HDU 5366:The mook jong 递推
- HDU 5366 The mook jong(递推)
- HDU 5366 The mook jong 递推 动态规划
- hdu 5366 The mook jong(递推)
- hdu 5366 The mook jong【递推】【思维】
- hdu 5366 The mook jong
- hdu 5366 The mook jong
- HDU 5366 The mook jong
- hdu 5366 The mook jong
- HDU 5366 The mook jong
- HDU-5366-The mook jong
- HDU 5366 The mook jong
- The mook jong (HDU 5366)
- hdu 5366 The mook jong
- HDU 5366 The mook jong
- HDU 5366 The mook jong(DP)
- hdu 5366 The mook jong dp
- HDU 5366-The mook jong(组合数学)
- hdu1728 逃离迷宫 【bfs记录转向次数 2种】
- mysql在同一个服务器中把表从一个数据库转到另一个数据库中
- SDUT 1028 Catch That Cow (BFS)
- MySql日期处理小例子
- bootstrap 几种导航栏
- HDU 5366 The mook jong(递推)
- POJ 1651:Multiplication Puzzle 矩阵相乘式DP
- Android DiskLruCache完全解析,硬盘缓存的最佳方案
- MyEclipse8.5设置注释
- Winfrom传值
- Kalilinux 2.0明天就要发布了
- Codeforces 567 B. Berland National Library
- MongoDB 基本命令
- 我同意条款---CheckBox的isChecked属性的使用