hdu 2046 骨牌铺方格(递推)

解题思路：Fibonacci数列

#include<stdio.h>#include<iostream>using namespace std;long long num[55]={0,1,2};void fun(){    int i;    for(i=3;i<=50;i++){        num[i]=num[i-1]+num[i-2];    }}int main(){    int n;    fun();    while(scanf("%d",&n)!=-1){        printf("%I64d\n",num[n]);    }    return 0;}