HDU-2046 骨牌铺方格【递推】

http://acm.hdu.edu.cn/showproblem.php?pid=2046

和前面的一样，a[i] = a[i-1] + a[i-2]

#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;


int main()
{
          int n;
          while(cin>>n && n)
          {
                    long long a[51];
                    a[1] = 1;
                    a[2] = 2;
                    a[3] = 3;
                    for(int i = 4;i<=n;i++)
                    {
                              a[i] = a[i-1] + a[i-2];
                    }
                    cout<<a[n]<<endl;
          }

}