剑指offer 斐波那契数列

#include <cstdio>
#include <iostream>
using namespace std;

int main()
{
long long f[100];
f[0] = 0;
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("%lld\n", f
);
return 0;
}