标签：blog http io 2014 amp log on sp
#include <stdio.h>
int fib(int n)
{
if (n<=1) return 1;
else return fib(n-1)+fib(n-2);
}
int main( )
{
int n;
scanf("%d",&n);
printf("%d\n" ,fib( n ) );
}
ppt Fibonacii数列的第n项------普通递归,布布扣,bubuko.com
标签：blog http io 2014 amp log on sp
原文地址：http://www.cnblogs.com/2014acm/p/3907860.html
