Find the maximum cost path in a triangle
triangle_prob.java reads input from triangle_input.txt, then calculates the maximum cost path to traverse from the root node of the triangle represented in triangle_input.txt to the bottom of it.
Original problem here: http://projecteuler.net/problem=18