递归方法:
#include <stdio.h>
#include <stdlib.h>
#pragma warning(disable:4996)
int Fibonacci(int n)
{
if (n<=2) return 1;
else return Fibonacci(n - 1) + Fibonacci(n - 2);
}
int main()
{
int n,i;
printf("请输入需要打印的项数:");
scanf("%d", &n);
for (i=1; i <= n; i++)
{
printf("%-5d ", Fibonacci(i));
if (i % 10 == 0) putchar('\n');//每行只打印10项
}
}
常规方法:
#include <stdio.h>
#include <stdlib.h>
#pragma warning(disable:4996)
#define n 20
int main()
{
int a = 0, b = 1;
printf("%-5d ", a);//先输出第一项
for (int i = 2; i <= n; i++)
{
if (i % 10 == 1) putchar('\n');//每行输出10项
printf("%-5d ", b);
b = a + b;
a = b - a;
}
}