111qqz的小窝

老年咸鱼冲锋!

hdu 5366 (bc #50 1003) The mook jong

The mook jong

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 269    Accepted Submission(s): 205

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).

 

 

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]=f[i-1]+f[i-3]+1
并不知道这个式子怎么推出来的.
我做的比较麻烦==

 

说点什么

您将是第一位评论人!

提醒
wpDiscuz
粤ICP备18103363