FCRE2.1 1310、数组1(菲波那契数列)

int main()

{

int Fibon[1000] = { 0 }, n, i;

Fibon[0] = 1;

Fibon[1] = 1;

scanf("%d", &n);

for (i = 2; i <= n - 1; i++)

{

Fibon[i] = Fibon[i - 2] + Fibon[i - 1];

}

for (i = 0; i <= n - 1; i++)

{

printf("%d\n", Fibon[i]);

}

return 0;

}