-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproblem2.py
More file actions
44 lines (32 loc) · 755 Bytes
/
problem2.py
File metadata and controls
44 lines (32 loc) · 755 Bytes
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
42
43
44
#Even Fibonacci numbers
#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.
'''
import logging
logging.basicConfig(level = logging.DEBUG)
def fib(n):
if (n == 0):
return 1
elif (n == 1):
return 1
else:
return (fib(n-2) + fib(n-1))
l = list()
l.append(1)
l.append(1)
i = 2
while(True):
l.append(l[i-1] + l[i-2])
if (l[i] >= 4000000):
l.pop()
break
i += 1
for i in range(len(l)):
if(l[i] % 2 != 0):
l[i] = 0
l.remove(0)
s = sum(l)
logging.debug(s)