int n;
scanf(“%d”,&n);
long long f[61];
f[0] =0,f[1] = 1;
for(int i =2;i<62;i++)f[i] = f[i-1]+f[i-2];
while(n–)
{
int i;
scanf(“%d”,&i);
printf(“Fib(%d) = %lld”,i,f[i]);
printf(“\n”);
}
//对应的f[i]而不是f(i),且预先算好可以节省内存