-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproblem_2.py
More file actions
43 lines (28 loc) · 745 Bytes
/
Copy pathproblem_2.py
File metadata and controls
43 lines (28 loc) · 745 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
"""
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 time
#Attempt 1
start_time = time.time()
x, y = 1, 2
total = 0
while x < 4000000:
x, y = y, x + y
if not x & 1:
total = total + x
print total
print time.time() - start_time, "seconds\n"
#Improvement 1
start_time = time.time()
x, y = 1, 2
total = 0
while x < 4000000:
x, y = y, x + y
if x % 2 == 0:
total = total + x
print total
print time.time() - start_time, "seconds\n"