int fib(int x)
{
if (x == 1 || x == 2)
return 1;
else
return fib(x - 1) + fib(x - 2);
}
int main()
{
int x = 0;
int ret = 0;
scanf("%d", &x);
ret = fib(x);
printf("%d", ret);
return 0;
}
递归实现斐波那契数列
于 2023-09-01 15:00:30 首次发布