Professional Documents
Culture Documents
ipynb - Colaboratory
# Monkey ladder problem
# Recursive function to find
# Nth fibonacci number
def fib(n):
if n <= 1:
return n
return fib(n-1) + fib(n-2)
# Returns no. of ways to
# reach sth stair
def countWays(s):
return fib(s + 1)
# Driver program
s = 6
print ("Number of ways = ", countWays(s))
Number of ways = 13
https://colab.research.google.com/drive/1m0eOYifPIJqsmhAXWGxcqSiAccO3NeLK#printMode=true 1/2