fork(1) download
  1. #include<stdio.h>
  2. long Fib(int n);
  3. int count;
  4.  
  5. int main(void)
  6. {
  7. int n, i, x;
  8. printf("Input n:");
  9. scanf("%d", &n);
  10. for (i = 1; i <= n; i++)
  11. {
  12. count = 0;
  13. x = Fib(i);
  14. printf("Fib(%d) = %d, count = %d\n", i, x, count);
  15. }
  16. return 0;
  17. }
  18.  
  19. long Fib(int n)
  20. {
  21. count++;
  22. if (n == 1)
  23. return 1;
  24. else if (n == 2)
  25. return 1;
  26. else
  27. return (Fib(n - 1) + Fib(n - 2));
  28. }
  29.  
Success #stdin #stdout 0s 544KB
stdin
5
stdout
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