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 run(n):
if n <= 2:
return 2
prev = 0
cur = 1
s = 0
while True:
prev , cur = cur , prev + cur
if cur >= n:break
if (cur & 1) == 0:
s += cur
return s
print run(4000000)