This question expands on our earlier Fibonacci Lite challenge. While the goal of Fibonacci Lite was to understand recursion, this challenge is about solving problems efficiently with dynamic programming. The difference in this challenge is that each test case will consist of many inputs instead of just one. Furthermore, we're allowing larger val…

Fibonacci Returns

from math import sqrt

def fibo(n):
    return (((1+sqrt(5))**n - (1-sqrt(5))**n)/(2**n*sqrt(5)))

while True:
    try:
        n = int(input().strip())
        print (int(fibo(n)))
    except(EOFError):
        break