BC#50 1003 The mook jong

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

#include <stdio.h>
#include <string.h>
int main()
{
    long long n;
    long long dp1[66],dp2[67];
    int i,j,k;
    while(scanf("%I64d",&n)!=EOF)
    {
        memset(dp1,0,sizeof(dp1));
        memset(dp2,0,sizeof(dp2));
        dp1[1]=1,dp2[1]=1;
        dp1[2]=2,dp2[2]=1;
        dp1[3]=3,dp2[3]=1;
        for(i=4;i<=n;i++)
        {
            dp1[i]=dp1[i-1]+dp2[i-1];
            dp2[i]=dp1[i-3]+dp2[i-3];
        }
        printf("%I64d
",dp1[n]+dp2[n]-1);
    }
    return 0;
}