当有n个方格的时候,有两种铺法:
1)先铺好n-1个格,有f(n-1)个方法,再铺第n层的时候只有一种方法,所以总方法是f(n-1);
#include <stdio.h>
#include <stdlib.h>
int main () {
int n;
int i;
__int64 a[60] = {0, 1, 2};
for (i = 3; i <= 51; i++)
a[i] = a[i - 1] + a[i - 2];
while (scanf ("%d", &n)==1)
printf ("%I64d\n", a[n]);
return 0;
}