首页 / C# / BC#50 1003 The mook jong

BC#50 1003 The mook jong

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了BC#50 1003 The mook jong，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1294字，纯文字阅读大概需要2分钟。

内容图文

The mook jong

 
 Accepts: 506
 
 Submissions: 1281
 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
技术分享 技术分享 
                             1 #include <stdio.h>
 2 #include <string.h>
 3int main()
 4{
 5longlong n;
 6longlong dp1[66],dp2[67];
 7int i,j,k;
 8while(scanf("%I64d",&n)!=EOF)
 9    {
10         memset(dp1,0,sizeof(dp1));
11         memset(dp2,0,sizeof(dp2));
12         dp1[1]=1,dp2[1]=1;
13         dp1[2]=2,dp2[2]=1;
14         dp1[3]=3,dp2[3]=1;
15for(i=4;i<=n;i++)
16        {
17             dp1[i]=dp1[i-1]+dp2[i-1];
18             dp2[i]=dp1[i-3]+dp2[i-3];
19        }
20         printf("%I64d\n",dp1[n]+dp2[n]-1);
21    }
22return0;
23 }
View Code

 

原文：http://www.cnblogs.com/cyd308/p/4771336.html

内容总结

以上是互联网集市为您收集整理的BC#50 1003 The mook jong全部内容，希望文章能够帮你解决BC#50 1003 The mook jong所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端

扫描二维码推送至手机访问。

本文链接：https://qyyshop.com/info/1203217.html

来源：【匿名】