Recursive Fibonacci

Given a function that computes the Fibonacci numbers, you are asked to compute the number of times the function was called. The function calls itself several times, which is called recursion and we will cover recursion in more detail later.
The program needs to print the total number of times the function fib is called.


Time limit: 2 seconds

Memory limit: 512 MB

Output limit: 1 MB

To check your solution you need to sign in
Sign in to continue