hdu-5366

      

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
   
   
题意：
   
   

   
   
ZJiaQ为了强身健体，决定通过木人桩练习武术。ZJiaQ希望把木人桩摆在自家的那个由1*1的地砖铺成的1*n的院子里。由于ZJiaQ是个强迫症，所以他要把一个木人桩正好摆在一个地砖上，由于木人桩手比较长，所以两个木人桩之间地砖必须大于等于两个，现在ZJiaQ想知道在至少摆放一个木人桩的情况下，有多少种摆法。
思路：
   
   

   
   

   
   
记f[i]为在长度是i的格子上面至少放一个木桩的方法数。考虑第i个格子，有放和不放两种情况。
   
   
1.如果第i个格子放了一个木桩，则i - 1和i - 2格子上面不能放木桩，方案数为：f[i - 3] + 1
   
   
2.如果第i个格子没有放木桩，则方案数为：f[i - 1]
   
   

   
   
#include <iostream>
#include <cstring>
using namespace std;
long long a[65];
int main()
{
    memset(a,0,sizeof(a));
    a[1]=1;a[2]=2;a[3]=3;
    for(int i=4;i<=60;i++)
    {
      a[i]=a[i-1]+a[i-3]+1;
    }
    int x;
    double sum;
    while(cin>>x)
    {
        cout<<a[x]<<endl;
    }
    return 0;
}