#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("%d count=%d",Fib
(i
),count
); }
return 0;
}
/* 函数功能:用递归法计算Fibonacci数列中的第n项的值 */
long Fib(int n)
{
count++;
if (n == 0) return 0; /* 基线情况 */
else if (n == 1) return 1; /* 基线情况 */
else return (Fib(n-1) + Fib(n-2)); /* 一般情况 */
}
I2luY2x1ZGUgPHN0ZGlvLmg+CmxvbmcgRmliKGludCBhKTsKbG9uZyBpbnQgY291bnQ7CmludCBtYWluKHZvaWQpCnsKICAgICAgIGludCBuLCBpLCB4OwogICAgICAgcHJpbnRmKCJJbnB1dCBuOiIpOwogICAgICAgc2NhbmYoIiVkIiwgJm4pOwogICAgICAgZm9yIChpPTE7IGk8PW47IGkrKykKICAgICAgIHsKICAgICAgICAgICBjb3VudD0wOwogICAgICAgICAgIHggPSBGaWIoaSk7CiAgICAgICAgICAgcHJpbnRmKCIlZCBjb3VudD0lZCIsRmliKGkpLGNvdW50KTsKICAgICAgIH0KICAgICAgIHJldHVybiAwOwp9Ci8qIOWHveaVsOWKn+iDve+8mueUqOmAkuW9kuazleiuoeeul0ZpYm9uYWNjaeaVsOWIl+S4reeahOesrG7pobnnmoTlgLwgKi8KbG9uZyBGaWIoaW50IG4pCnsKICAgIGNvdW50Kys7CiAgICBpZiAobiA9PSAwKSAgICAgICAgIHJldHVybiAwOyAgICAgICAgICAvKiDln7rnur/mg4XlhrUgKi8KICAgIGVsc2UgaWYgKG4gPT0gMSkgICByZXR1cm4gMTsgICAgICAgICAgLyog5Z+657q/5oOF5Ya1ICovCiAgICBlbHNlICAgcmV0dXJuIChGaWIobi0xKSArIEZpYihuLTIpKTsgLyog5LiA6Iis5oOF5Ya1ICovCgp9