简单递归____Fibonacci数列

 1 #include <stdio.h>
 2 int fun(int x)
 3 {
 4     if(x==1||x==2)
 5       return 1;
 6     else
 7       return fun(x-1)+fun(x-2);
 8 }
 9 int main()
10 {
11    int n,i;
12    scanf("%d",&n);
13    printf("%d",fun(n)%10007);
14    return 0;
15 }

 

转载于:https://www.cnblogs.com/wwjyt/p/3608918.html