骨牌铺方格（菲波那切数列）

 1 #include<iostream>
 2 #include<iomanip>
 3 //#include<bits/stdc++.h>
 4 #include<cstdio>
 5 #include<cmath>
 6 #include<cstring>
 7 #include<algorithm>
 8 #include<sstream>
 9 #define PI  3.14159265358979
10 #define LL long long
11 #define  eps   0.00000001
12 using namespace std;
13 LL f[100];
14 LL solve(LL x)
15 {
16     if(f[x]) return f[x];
17     for(int i=4;i<=x;++i)
18     {
19         f[i]=f[i-1]+f[i-2];
20     }
21     return f[x];
22 }
23 int main()
24 {
25     int T;
26     f[1]=1,f[2]=2,f[3]=3;
27     while(cin>>T)
28     {
29         cout<<solve(T)<<endl;
30     }
31 
32 }