用数组来处理求Fibonacci数列前40个数

2025-05-14 13:11:57
推荐回答(1个)
回答(1):

//F0 = 0;
//F1 = 1;
//F2 = F1+F0;
//Fn=Fn-1 + Fn-2;
int main()
{
int i;

int Fn[40];

Fn[0] = 0;

Fn[1] = 1;
for (i = 2; i< 40;i++)
{
Fn[i] = Fn[i-1] + Fn[i-2];
printf("d%",Fn[i]);
}
return 0;

}