算法提示:Fibonacci数列的规律是后一个数是前两个数之和,例如1,1,2,3,5,8,13,21
#include <stdio.h>
int fib(int n)
{
if (n == 1 || n == 2)
{
return 1;
}
else
{
return fib(n - 1) + fib(n - 2);
}
}
int main(int argc, char* argv[])
{
for (int i = 1; i <= 20; i++)
{
printf("%d\n", fib(i));
}
return 0;
}