斐波那契数列只要根据定义,一步一步求数就行了。
具体程序如下:
void Fibonacci(int n)
{
int arr[100] = {0, 1, 1 };
for (int i = 3; i <= n; i++)
{
arr[i] = arr[i - 1] + arr[i - 2];
}
for (int i = 1; i <= n; i++)
{
cout << arr[i] << " ";
if (i % 5 == 0)
cout << endl;
}
cout << endl;
}
结果如图:
![](https://video.ask-data.xyz/img.php?b=https://iknow-pic.cdn.bcebos.com/11385343fbf2b211127c6e38cf8065380cd78e72?x-bce-process=image%2Fresize%2Cm_lfit%2Cw_600%2Ch_800%2Climit_1%2Fquality%2Cq_85%2Fformat%2Cf_auto)