Project-Euler/Maximum_Path_Sum1.py at master · by7e/Project-Euler · GitHub

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
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]
]
# Start from the top of the triangle
maximum_path = triangle[0][0]

for i in range(1, len(triangle)):
    for j in range(len(triangle[i])):
        if j == 0: # First element in a row
            triangle[i][j] += triangle[i - 1][j]
        elif j == len(triangle[i]) - 1: # Last element in the row
            triangle[i][j] += triangle[i - 1][j - 1]
        else: # Middle elements can come from two paths
            triangle[i][j] += max(triangle[i - 1][j - 1], triangle[i - 1][j])

# Find the maximum in the last row
maximum_path = max(triangle[-1])

print(maximum_path) # 1074
# end