The mook jong
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 690 Accepted Submission(s): 478
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
1 2 3 4 5 6
Sample Output
1 2 3 5 8 12
Source
出题人:令f[i]为最后一个木人桩摆放在i位置的方案,
令s[i]为f[i]的前缀和。很容易就能想到f[i]=s[i-3]+1,
s[i]=s[i-1]+f[i],而s[n]即是所求答
案。
本题唯一一个值得注意的点
就是当n接近60时会爆int。
#include
#include
using namespace std;
long long a[61]={0,1,2,3};
int main()
{
int n,t,i,j;
for (i=4;i<=60;i++)
a[i]=a[i-1]+a[i-3]+1;
while(~scanf("%d",&n))
{
printf("%lld\n",a[n]);
}
return 0;
}