#include <stdio.h>
long Fib(int a);
long int count;
int main(void)
{
int n, i, x;
for (i=1; i<=n; i++)
{
count=0;
x = Fib(i);
printf("Fib(%d)=%d,count=%d\n",i
,x
,count
); }
return 0;
}
/* 函数功能:用递归法计算Fibonacci数列中的第n项的值 */
long Fib(int n)
{
count++;
if (n == 1) return 1; /* 基线情况 */
else if (n == 2) return 1; /* 基线情况 */
else return (Fib(n-1) + Fib(n-2)); /* 一般情况 */
}
I2luY2x1ZGUgPHN0ZGlvLmg+CmxvbmcgRmliKGludCBhKTsKbG9uZyBpbnQgY291bnQ7CmludCBtYWluKHZvaWQpCnsKICAgICAgIGludCBuLCBpLCB4OwogICAgICAgcHJpbnRmKCJJbnB1dCBuOlxuIik7CiAgICAgICBzY2FuZigiJWQiLCAmbik7CiAgICAgICBmb3IgKGk9MTsgaTw9bjsgaSsrKQogICAgICAgewogICAgICAgICAgIGNvdW50PTA7CiAgICAgICAgICAgeCA9IEZpYihpKTsKICAgICAgICAgICBwcmludGYoIkZpYiglZCk9JWQsY291bnQ9JWRcbiIsaSx4LGNvdW50KTsKICAgICAgIH0KICAgICAgIHJldHVybiAwOwp9Ci8qIOWHveaVsOWKn+iDve+8mueUqOmAkuW9kuazleiuoeeul0ZpYm9uYWNjaeaVsOWIl+S4reeahOesrG7pobnnmoTlgLwgKi8KbG9uZyBGaWIoaW50IG4pCnsKICAgIGNvdW50Kys7CiAgICBpZiAobiA9PSAxKSAgICAgICAgcmV0dXJuIDE7ICAgICAgICAgIC8qIOWfuue6v+aDheWGtSAqLwogICAgZWxzZSBpZiAobiA9PSAyKSByZXR1cm4gMTsgICAgICAgICAgLyog5Z+657q/5oOF5Ya1ICovCiAgICBlbHNlICAgcmV0dXJuIChGaWIobi0xKSArIEZpYihuLTIpKTsgLyog5LiA6Iis5oOF5Ya1ICovCgp9
Input n:
Fib(1)=1,count=1
Fib(2)=1,count=1
Fib(3)=2,count=3
Fib(4)=3,count=5
Fib(5)=5,count=9
Fib(6)=8,count=15
Fib(7)=13,count=25
Fib(8)=21,count=41
Fib(9)=34,count=67
Fib(10)=55,count=109