mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-27 23:11:09 +00:00
f36a2f621e
* Fix typehints in project_euler/problem01
Squashed commit of the following:
commit 6801d073b31bf702814861cd3b07b634ca295bfa
Author: Archaengel <god11341258@gmail.com>
Date: Mon Oct 5 16:40:10 2020 -0700
Fix typehints in project_euler/problem01
commit 29afc3af114abd1b99dc3f7c8fc99128229db131
Author: Archaengel <god11341258@gmail.com>
Date: Mon Oct 5 15:06:34 2020 -0700
Add typehints and default argument for project_euler/problem_01
* Add default args, typehints, and expand variable names for PE prob 02
47 lines
981 B
Python
47 lines
981 B
Python
"""
|
|
Problem:
|
|
Each new term in the Fibonacci sequence is generated by adding the previous two
|
|
terms. By starting with 1 and 2, the first 10 terms will be:
|
|
|
|
1,2,3,5,8,13,21,34,55,89,..
|
|
|
|
By considering the terms in the Fibonacci sequence whose values do not exceed
|
|
n, find the sum of the even-valued terms. e.g. for n=10, we have {2,8}, sum is
|
|
10.
|
|
"""
|
|
|
|
|
|
def solution(n: int = 4000000) -> int:
|
|
"""Returns the sum of all fibonacci sequence even elements that are lower
|
|
or equals to n.
|
|
|
|
>>> solution(10)
|
|
10
|
|
>>> solution(15)
|
|
10
|
|
>>> solution(2)
|
|
2
|
|
>>> solution(1)
|
|
0
|
|
>>> solution(34)
|
|
44
|
|
"""
|
|
|
|
fib = [0, 1]
|
|
i = 0
|
|
while fib[i] <= n:
|
|
fib.append(fib[i] + fib[i + 1])
|
|
if fib[i + 2] > n:
|
|
break
|
|
i += 1
|
|
total = 0
|
|
for j in range(len(fib) - 1):
|
|
if fib[j] % 2 == 0:
|
|
total += fib[j]
|
|
|
|
return total
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(solution(int(input().strip())))
|