递归
int Fibonacci(int n)
{
if (n == 1)
return 1;
else if (n == 2)
return 1;
else
return (Fibonacci(n-1) + Fibonacci(n-2));
}
for (int i = 1; i <= 40; i++)
printf("%d\n", Fibonacci(i));
数组
int a[40];
a[0] = 1;
a[1] = 1;
for (int i = 2; i < 40; i++)
{
a[i] = a[i-1] + a[i-2];
}
for (int i = 0; i < 40; i++)
printf("%d\n", a[i]);
本文如未解决您的问题请添加抖音号:51dongshi(抖音搜索懂视),直接咨询即可。