mirror of
https://github.com/correl/euler.git
synced 2024-11-27 19:19:50 +00:00
17 lines
499 B
Python
17 lines
499 B
Python
|
# -*- coding: utf-8 -*-
|
||
|
|
# 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, ...
|
||
|
|
# Find the sum of all the even-valued terms in the sequence which do not exceed four million.
|
||
|
|
|
||
|
|
limit = 4000000
|
||
|
|
#limit = 90
|
||
|
|
last = [0, 1]
|
||
|
|
x = 1
|
||
|
|
total = 0
|
||
|
|
while (x < limit):
|
||
|
|
if (0 == x % 2):
|
||
|
|
total += x
|
||
|
|
last.append(x)
|
||
|
|
last = last[-2:]
|
||
|
|
x = sum(last)
|
||
|
|
print 'Answer', total
|