Created
October 19, 2020 01:01
-
-
Save mcvarer/d6227cf88d20d2a7191eeea83ecdfeaf to your computer and use it in GitHub Desktop.
projecteuler:2
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
""" | |
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 four million, | |
find the sum of the even-valued terms. | |
""" | |
def fibSeries(a: int, b: int) -> int: | |
ret = [] | |
M = 53 | |
for i in range(0, M): | |
a, b = b, a + b | |
if a % 2 == 0 and sum(ret) < 4000000: | |
ret.append(a) | |
return sum(ret) | |
print("Fibonacci answer = {}".format(fibSeries(0, 1))) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment