#include <stdio.h>
#define N 20
void my_fibona (int arr[],int n)
{
arr[0] = 1;
arr[1] = 1;
int i = 0;
for (i = 3; i < n; i++)
{
arr[i] = arr[i - 1] + arr[i - 2];
}
}
int main()
{
int arr[N] = { 0 };
my_fibona(arr, N);
int j = 0;
for (j = 1; j < N; j++)
{
printf("%-3d ", arr[j]);
if (j % 2 == 0)
{
printf("\n");
}
}
return 0;
}
建立斐波那契数列的数组
最新推荐文章于 2024-07-25 15:54:02 发布