<reponame>jaimeliew1/Project_Euler_Solutions
# -*- coding: utf-8 -*-
"""
Solution to Project Euler problem 18

Author: <NAME>
https://github.com/jaimeliew1/Project_Euler_Solutions
"""

data_raw = '''75
95 64
17 47 82
18 35 87 10
20 04 82 47 65
19 01 23 75 03 34
88 02 77 73 07 63 67
99 65 04 28 06 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 04 68 89 53 67 30 73 16 69 87 40 31
04 62 98 27 23 09 70 98 73 93 38 53 60 04 23'''

def run():
    #Split each level into a list.
    data = []
    for line in data_raw.split('\n'):
        data.append([int(x) for x in line.split(' ')])

#    starts from the bottom of the pyramid and works upwards to create
#    a cumulitive sum pyramid, where the value at each point is the maximum
#    value of possible sums below that point
    for n in range(len(data)-2,-1,-1):
        for i, num in enumerate(data[n]):
            data[n][i] += max(data[n+1][i],data[n+1][i+1])
    return data[0][0]


if __name__ == "__main__":
	print(run())

