-
Notifications
You must be signed in to change notification settings - Fork 0
/
EulerP18.py
executable file
·30 lines (29 loc) · 1.08 KB
/
EulerP18.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
triangle = [ [75],
[95, 64],
[17, 47, 82],
[18, 35, 87, 10],
[20, 4, 82, 47, 65],
[19, 1, 23, 75, 3, 34],
[88, 2, 77, 73, 7, 63, 67],
[99, 65, 4, 28, 6, 16, 70, 92],
[41, 41, 26, 56, 83, 40, 80, 70, 33],
[41, 48, 72, 33, 47, 32, 37, 16, 94, 29],
[53, 71, 44, 65, 25, 43, 91, 52, 97, 51, 14],
[70, 11, 33, 28, 77, 73, 17, 78, 39, 68, 17, 57],
[91, 71, 52, 38, 17, 14, 91, 43, 58, 50, 27, 29, 48],
[63, 66, 4, 68, 89, 53, 67, 30, 73, 16, 69, 87, 40, 31],
[ 4, 62, 98, 27, 23, 9, 70, 98, 73, 93, 38, 53, 60, 4, 23]]
if __name__ == '__main__':
for n in reversed(range(1, len(triangle))):
list = triangle[n]
best_path = []
while len(list) > 1:
if list[-1] > list[-2]:
best_path.insert(0, list[-1])
else:
best_path.insert(0, list[-2])
list.pop()
for m in range(len(best_path)):
triangle[n - 1][m] += best_path[m]
print(best_path)
print(triangle[0][0])