#include <stdio.h>
long Fib(int a);
int main(void)
{
int n, i, x;
for (i=1; i<=n; i++)
{
x = Fib(i); /* 调用递归函数Fib()计算Fibonacci数列的第n项 */
}
return 0;
}
/* 函数功能:用递归法计算Fibonacci数列中的第n项的值 */
long Fib(int a)
{
if(a==1) return 1;
else if(a==2) return 1;
else return(Fib(a-1)+Fib(a-2));
}
I2luY2x1ZGUgPHN0ZGlvLmg+CmxvbmcgRmliKGludCBhKTsKaW50IG1haW4odm9pZCkKewogICAgICAgaW50IG4sIGksIHg7CiAgICAgICBwcmludGYoIklucHV0IG46Iik7CiAgICAgICBzY2FuZigiJWQiLCZuKTsKICAgICAgIGZvciAoaT0xOyBpPD1uOyBpKyspCiAgICAgICB7CiAgICAgICAgICAgeCA9IEZpYihpKTsgICAgLyog6LCD55So6YCS5b2S5Ye95pWwRmliKCnorqHnrpdGaWJvbmFjY2nmlbDliJfnmoTnrKxu6aG5ICovCiAgICAgICAgICAgcHJpbnRmKCJGaWIoJWQpPSVkXG4iLCBpLCB4KTsKICAgICAgIH0KICAgICAgIHJldHVybiAwOwp9Ci8qIOWHveaVsOWKn+iDve+8mueUqOmAkuW9kuazleiuoeeul0ZpYm9uYWNjaeaVsOWIl+S4reeahOesrG7pobnnmoTlgLwgKi8KbG9uZyBGaWIoaW50IGEpCnsKICAgaWYoYT09MSkgcmV0dXJuIDE7CiAgIGVsc2UgaWYoYT09MikgcmV0dXJuIDE7CiAgIGVsc2UgcmV0dXJuKEZpYihhLTEpK0ZpYihhLTIpKTsgCn0K