BestCoder Round #50 The mook jong 即hdu5366 （动态规划）

The mook jong

 

 Accepts: 221

 

 Submissions: 306

 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

解析：f[i]表示长度为 i 得方案数，则：

          f[i]=            f[i-1]           +             f[i-3]            +        1

              最后一个不放木桩          最后一个放木桩         只在最后一格放木桩

代码：

#include<cstdio>
long long a[70];

int main()
{
  int i,j,k;
  a[1]=1,a[2]=2,a[3]=3;
  for(i=4;i<=60;i++)a[i]=a[i-1]+a[i-3]+1;
  while(scanf("%d",&k)!=EOF)
    printf("%I64d\n",a[k]);
  return 0;
}