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<bits/stdc++.h>
typedef long long lint;
using namespace std;
lint a[70];
int main()
{int n,m;memset(a,0,sizeof(a));int i;a[1]=1;int ans=1;a[2]=2;a[3]=3;for(i=4;i<65;++i){a[i]=a[i-1]+a[i-3]+1;++ans;}while(cin>>n){cout<<a[n]<<endl;}return 0;
}

The mook jong(HDU 5366)相关推荐

  1. The mook jong (HDU 5366)

    The mook jong Description ![](../../data/images/C613-1001-1.jpg) ZJiaQ want to become a strong man, ...

  2. hdu 5366 The mook jong

    hdu 5366 The mook jong Problem Description ZJiaQ want to become a strong man, so he decided to play ...

  3. HDU 5366 The mook jong (动态规划,详解)

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5366 题面: The mook jong Accepts: 221 Submissions: 306 ...

  4. 【HDU 5366】The mook jong 详解

    2019独角兽企业重金招聘Python工程师标准>>> The mook jong Time Limit: 2000/1000 MS (Java/Others)    Memory ...

  5. Hdu 5366 The mook jong 公式求解

    The mook jong  Time Limit: 2000/1000 MS (Java/Others)  Memory Limit: 65536/65536 K (Java/Others) 问题描 ...

  6. HDU 5366-The mook jong(组合数学)

    题目地址:HDU 5366 题意: 问题描述 ZJiaQ为了强身健体,决定通过木人桩练习武术.ZJiaQ希望把木人桩摆在自家的那个由1*1的地砖铺成的1*n的院子里.由于ZJiaQ是个强迫症,所以他要 ...

  7. The mook jong 计数DP

    The mook jong ZJiaQ为了强身健体,决定通过木人桩练习武术.ZJiaQ希望把木人桩摆在自家的那个由1*1的地砖铺成的1*n的院子里.由于ZJiaQ是个强迫症,所以他要把一个木人桩正好摆 ...

  8. Hdu5366 The mook jong

    Problem Description ZJiaQ want to become a strong man, so he decided to play the mook jong.ZJiaQ wan ...

  9. BC之The mook jong

    Problem Description ZJiaQ want to become a strong man, so he decided to play the mook jong.ZJiaQ wan ...

最新文章

  1. java设计模——反射的应用 (利用反射来去除if判断语句)
  2. 从Internet上抓取指定URL的源码的方案
  3. lr参数化取值与连接数据库
  4. CentOS学习笔记--目录配置
  5. spark之4:编程指南
  6. mysql 开启引擎命令_MySql中启用InnoDB数据引擎的方法
  7. 华为再发行30亿元超短期融资券
  8. nginx ---- 静态资源部署
  9. python状态码及其含义_Shell退出状态码及其应用详解
  10. [笔记]《白帽子讲Web安全》- Web框架安全
  11. zuul网关_SpringCould之服务网关(zuul)介绍与配置
  12. c语言链表排序交换节点,链表节点排序问题
  13. 角度传感器原理和应用
  14. 华为外包的感受(CSDN)
  15. unity 弹窗提示_【原创】Unity3D 消息提示框
  16. java将uuid转换成大写,python生成大写32位uuid代码
  17. node.js使用puppeteer来html生成pdf
  18. 软件需求评审会到底做什么?
  19. 销售人员如何打电话?
  20. 易语言怎么注册大漠插件

热门文章

  1. java基础-图形化界面(一)
  2. php 将CST时间转成格式化时间
  3. 谈谈生活中那些与学习相关的事儿
  4. JavaGuide github 地址及中文学习文档
  5. 区块链源码,已布局能源领域
  6. 概率论复习之关于点估计
  7. Markdown–Haroopad使用说明
  8. Python学习笔记合集(总结)
  9. zabbix集成onealert验证报错:create media type failed! error message
  10. 一款可以代替 viso 的开源免费绘图神器,程序员必备!