#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
//1 1 2 3 5 8 13
int fib(int n)
{
if (n <= 2)
return 1;
else
return(fib(n - 1) + fib(n - 2));
}
int main()
{
int n = 0;
int ret = 0;
scanf("%d", &n);
ret = fib(n);
printf("%d", ret);
system("pause");
return 0;
}
递归求斐波那契数
最新推荐文章于 2024-04-25 17:04:59 发布