Euler #5

gistfile1.py

memo = [0, 1]
def memofib(n):
    if n >= len(memo):
        i = len(memo)
        while i <= n:
            memo.append(memo[i-1] + memo[i-2])
            i += 1

    return memo[n]

def fiblong (n) :
    return n > 10 ** 999

i = 1

while fiblong(memofib(i)) != True:
    i += 1
    
print i