递归实现找到第n个斐波那契数

#include<stdio.h>

#include<string.h>

int count = 0;

int Fib(int n)

{

 if(n==3)

count++;

 if(n<=2)

 {return 1;}

 else

return Fib(n-1)+Fib(n-2);

}

int main()

{  

int n = 0;

int fib = Fib(n);

scanf("%d",&n);

printf("%d\n",Fib);

printf("count=%d\n",count);

 return 0;

}