习题10-6 递归求Fabonacci数列 (10 分)

#include <stdio.h>

int f( int n );

int main()
{
int n;

scanf("%d", &n);
printf("%d\n", f(n));

return 0;

}

/* 你的代码将被嵌在这里 */

int f( int n )
{
long sum;
if(n > 1)
sum = f(n-2) + f(n-1);
else if(n == 1)
sum = 1;
else if(n == 0)
sum = 0;
return sum;
}