"""P67: Correct."""
from pe18 import solve
if __name__ == '__main__':
with open('pe67.txt', 'r') as f:
n = solve(f.read().splitlines())
# 7273
print(n)
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)
"""
def get_triangle( fn ) :
with open(fn, 'r') as f :
return [ [int(i) for i in row.split(' ')] for row in f if row ]
ns = get_triangle("pe67_triangle.txt")
from pe18 import solve
s = solve(ns)
assert s == 7273
