# Euler Problem 67¶

Back to overview.

By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.

       3
      7 4
     2 4 6
    8 5 9 3

That is, 3 + 7 + 4 + 9 = 23.

Find the maximum total from top to bottom in triangle.txt (right click and 'Save Link/Target As...'), a 15K text file containing a triangle with one-hundred rows.

NOTE: This is a much more difficult version of Problem 18. It is not possible to try every route to solve this problem, as there are 299 altogether! If you could check one trillion (1012) routes every second it would take over twenty billion years to check them all. There is an efficient algorithm to solve it. ;o)

So let's hope our solution is good. I have saved the triangle in a file EulerProblem067.txt in the same directory as this notebook.

In [1]:

    def find_greatest_path_sum_in_triangle_string(ts):
        from functools import reduce
        xss = [list(map(int, xs.split())) for xs in ts.split("\n") if xs]
        xss.reverse()
        r = lambda xs, ys: [max([xs[i] + ys[i], xs[i + 1] + ys[i]]) for i in range(len(ys))]
        return reduce(r, xss[1:], xss[0])[0]

    with open('EulerProblem067.txt', 'r') as f:
        triangle_string = f.read()

    print(find_greatest_path_sum_in_triangle_string(triangle_string))

    7273

Well, that was fast.