Project Euler problem 67

gistfile1.py

import operator, csv
 
pyramid = []
 
with open ('triangle.txt', 'rb') as csvfile:
	reader = csv.reader(csvfile, delimiter='\n')
	for row in reader:
		temp = row[0].split()
		for x in range(len(temp)):
			temp[x]=int(temp[x])
		pyramid.append(temp)
	
sums = [0]*len(pyramid)
maxpath = 0
for row in reversed(pyramid):
	row = map (operator.add, row, sums)
	sums = []
	a = row.pop()
	while (row):
		b = row.pop();
		sums.append(max(a, b))
		a = b
	sums.reverse()
	maxpath = a
print (maxpath)