Python/Project Euler/Problem 25/sol1.py
2018-03-14 14:55:07 -04:00

26 lines
458 B
Python

from __future__ import print_function
def fibonacci(n):
if n == 1 or type(n) is not int:
return 0
elif n == 2:
return 1
else:
sequence = [0, 1]
for i in xrange(2, n+1):
sequence.append(sequence[i-1] + sequence[i-2])
return sequence[n]
def fibonacci_digits_index(n):
digits = 0
index = 2
while digits < n:
index += 1
digits = len(str(fibonacci(index)))
return index
if __name__ == '__main__':
print(fibonacci_digits_index(1000))