-
Notifications
You must be signed in to change notification settings - Fork 0
/
EvenFibonacci.py
41 lines (31 loc) · 948 Bytes
/
EvenFibonacci.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
#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.
#Create initial conditions for fibonacci
fiblist = [1, 1]
#Create a sum variable
sumv = 0
#fib calculates a new fibonacci term and:
# if that term is even, will add the term to the current sum
def fib():
global fiblist
global sumv
#Check for stop condition
for x in fiblist:
if x > 4000000:
return
#Calculate new fibonacci
new = fiblist[0] + fiblist[1]
#If this term is even, add it to the sum
if new % 2 == 0:
sumv += new
#Change the list for the next call
fiblist[0], fiblist[1] = fiblist[1], new
#Make the next call
fib()
#Start the process
fib()
#Output the result
print sumv