斐波那契数列:1 1 2 3 5 8 13~~~
即n<=2时,Fib(n)=1
n>2时,Fib(n)=Fib(n-1)+Fib(n-2)
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int Fib(int n)
{
if (n <= 2)
return 1;
else
return Fib(n - 1) + Fib(n - 2);
}
int main()
{
int n = 0;
scanf("%d", &n);
int ret = Fib(n);
printf("%d\n", ret);
return 0;
}