1283: 骨牌铺方格（zzuli）

 1 #include<cstdio>
 2 #include<algorithm>
 3 #include<map>
 4 using namespace std;
 5 int main()
 6 {
 7     int n;
 8     long long s[100];
 9     s[0] = 1, s[1] = 1;
10     for (int i = 2; i <= 50; i++)
11     {
12         s[i] = s[i - 1] + s[i - 2];
13     }
14     while (~scanf("%d", &n))
15     {
16         printf("%ld\n", s[n]);
17     }
18     return 0;
19 }