[jobdu]矩形覆盖

#include <cstdio>
#define LEN 75
#define ulong unsigned long long
using namespace std;

ulong F[LEN];

int main()
{
F[0] = 1;
F[1] = 1;
for (int i = 2; i <= 70; i++)
{
F[i] = F[i-1] + F[i-2];
}

int n;
while(scanf("%d", &n)!=EOF)
{
printf("%ld\n",F
);
}
return 0;
}