Project Euler Problem 2

Problem 2

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.

# 求4百万以下的Fibonacci数列中偶数的和。

l = [1,2]; i = 0; sum1 = 2

while True:

    temp = l[i] + l[i+1]

    if temp > 4000000:

        break

    l.append(temp)

    if temp % 2 == 0:

        sum1 += temp

    i += 1

print(sum1)

结果：4613732