This file contains the solution to Problem 67 of Project Euler

triangles.py

#! /usr/bin/env python

with open('p067_triangle.txt') as f:
    triangle = [[int(y) for y in x.strip().split(' ')] for x in f.readlines()]
    upsidedown = list(reversed(triangle))
    rowpairs = zip(upsidedown, upsidedown[1:])
    for bot, top in rowpairs:
        for i, x in enumerate(top):
            top[i] = x + max(bot[i], bot[i+1])
    print(triangle[0][0])