-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathEuler Problem #9.py
47 lines (34 loc) · 935 Bytes
/
Euler Problem #9.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
42
43
44
45
46
47
import time
def is_triple(a, b, c):
return a ** 2 + b ** 2 == c ** 2 and a < b and b < c
time_s = time.time()
sum = 1000
for a in range(1, sum):
for b in range(a + 1, sum):
for c in range(b + 1, sum):
if is_triple(a, b, c) and a + b + c == 1000:
print(a, b, c)
print(a * b * c)
times = time.time() - time_s
print(times)
time_s = time.time()
sum = 1000
for a in range(1, sum):
for b in range(1, sum):
for c in range(1, sum):
if is_triple(a, b, c) and a + b + c == 1000:
print(a, b, c)
print(a * b * c)
times = time.time() - time_s
print(times)
time_s = time.time()
sum = 1000
for a in range(1, sum):
for b in range(a + 1, sum):
c = b + 1
while (c ** 2 < b ** 2 + a ** 2):
c += 1
if is_triple(a, b, c):
print(a * b * c)
times = time.time() - time_s
print("Time: ", times)