mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-28 07:21:07 +00:00
267b5eff40
* Added doctest and more explanation about Dijkstra execution. * tests were not passing with python2 due to missing __init__.py file at number_theory folder * Removed the dot at the beginning of the imported modules names because 'python3 -m doctest -v data_structures/hashing/*.py' and 'python3 -m doctest -v data_structures/stacks/*.py' were failing not finding hash_table.py and stack.py modules. * Moved global code to main scope and added doctest for project euler problems 1 to 14. * Added test case for negative input. * Changed N variable to do not use end of line scape because in case there is a space after it the script will break making it much more error prone. * Added problems description and doctests to the ones that were missing. Limited line length to 79 and executed python black over all scripts. * Changed the way files are loaded to support pytest call. * Added __init__.py to problems to make them modules and allow pytest execution. * Added project_euler folder to test units execution * Changed 'os.path.split(os.path.realpath(__file__))' to 'os.path.dirname()'
76 lines
1.3 KiB
Python
76 lines
1.3 KiB
Python
# -*- coding: utf-8 -*-
|
||
"""
|
||
The Fibonacci sequence is defined by the recurrence relation:
|
||
|
||
Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.
|
||
|
||
Hence the first 12 terms will be:
|
||
|
||
F1 = 1
|
||
F2 = 1
|
||
F3 = 2
|
||
F4 = 3
|
||
F5 = 5
|
||
F6 = 8
|
||
F7 = 13
|
||
F8 = 21
|
||
F9 = 34
|
||
F10 = 55
|
||
F11 = 89
|
||
F12 = 144
|
||
|
||
The 12th term, F12, is the first term to contain three digits.
|
||
|
||
What is the index of the first term in the Fibonacci sequence to contain 1000
|
||
digits?
|
||
"""
|
||
|
||
try:
|
||
xrange # Python 2
|
||
except NameError:
|
||
xrange = range # Python 3
|
||
|
||
|
||
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
|
||
|
||
|
||
def solution(n):
|
||
"""Returns the index of the first term in the Fibonacci sequence to contain
|
||
n digits.
|
||
|
||
>>> solution(1000)
|
||
4782
|
||
>>> solution(100)
|
||
476
|
||
>>> solution(50)
|
||
237
|
||
>>> solution(3)
|
||
12
|
||
"""
|
||
return fibonacci_digits_index(n)
|
||
|
||
|
||
if __name__ == "__main__":
|
||
print(solution(int(str(input()).strip())))
|