Project Euler 25

1000-digit Fibonacci number

The Fibonacci sequence is defined by the recurrence relation:

F _n = F _n−1 + F _n−2, where F ₁ = 1 and F ₂ = 1.

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 index of the first term in the Fibonacci sequence to contain 1000 digits?

就是一个斐波拉契数列数列……

直接上代码：

# coding utf-8
# Desc : Project Euler Problem 19 Fibonacci number
# Date : 2015-12-23
# Author : Tina

def fibonacci(n):
    fac1 = 1
    fac2 = 1
    for x in xrange(2,n):
        tmp = fac2
        fac2 = fac1+fac2
        fac1 = tmp
    return fac2

n = 1
i = 5
while(n<1000):
    x = fibonacci(i)
    n = len(str(x))
    i = i+1
print i-1