栈应用之三递归（之二数列求和）

#include<stdio.h>
//fibonacci数列求和
long fib(long n){
if(n==0) return 0;
if(n==1) return 1;
return (fib(n-1)+fib(n-2));
}

int main(){
 long n;
 printf("input your n:");
 scanf("%ld",&n);
printf("the answer is :%ld\n",fib(n));

}