Project Euler Problem 25

Problem 25

The Fibonacci sequence is defined by the recurrence relation:
F₁ = 1 F₂ = 1
F_n = F_n−1 + F_n−2

Hence the first 12 terms will be:
F₁ = 1
F₂ = 1
F₃ = 2
F₄ = 3
F₅ = 5
F₆ = 8
F₇ = 13
F₈ = 21
F₉ = 34
F₁₀ = 55
F₁₁ = 89
F₁₂ = 144

The 12th term, F₁₂, is the first term to contain three digits.

What is the first term in the Fibonacci sequence to contain 1000 digits?

# 第几个斐波那契数第一个拥有1000位数？

l = [1,1]
i = 0
while True:
    if len(str(l[i+1])) == 1000:
        print(i+2)
        break
    l.append(l[i] + l[i+1])
    i += 1

结果：4782