#include<stdio.h>
long Fib(int n);
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;
}
long Fib(int n)
{
count++;
if (n == 1)
return 1;
else if (n == 2)
return 1;
else
return (Fib(n - 1) + Fib(n - 2));
}
I2luY2x1ZGU8c3RkaW8uaD4KbG9uZyBGaWIoaW50IG4pOwppbnQgY291bnQ7CgppbnQgbWFpbih2b2lkKQp7CiAgICBpbnQgbiwgaSwgeDsKICAgIHByaW50ZigiSW5wdXQgbjoiKTsKICAgIHNjYW5mKCIlZCIsICZuKTsKICAgIGZvciAoaSA9IDE7IGkgPD0gbjsgaSsrKQogICAgewogICAgICAgIGNvdW50ID0gMDsKICAgICAgICB4ID0gRmliKGkpOwogICAgICAgIHByaW50ZigiRmliKCVkKSA9ICVkLCBjb3VudCA9ICVkXG4iLCBpLCB4LCBjb3VudCk7CiAgICB9CiAgICByZXR1cm4gMDsKfQoKbG9uZyBGaWIoaW50IG4pCnsKICAgIGNvdW50Kys7CiAgICBpZiAobiA9PSAxKQogICAgICAgIHJldHVybiAxOwogICAgZWxzZSBpZiAobiA9PSAyKQogICAgICAgIHJldHVybiAxOwogICAgZWxzZQogICAgICAgIHJldHVybiAoRmliKG4gLSAxKSArIEZpYihuIC0gMikpOwp9Cg==