Maximum triangle path sum: Difference between revisions

{{task}}

Starting from the top of a pyramid of numbers like this, you can walk down going one step on the right or on the left, until you reach the bottom row:

<pre>

94 48

95 30 96

One of such walks is 55 - 94 - 30 - 26.

Your problem is to find the maximum total among all possible paths from the top to the bottom row of the triangle. In the little example above it's 321.

<pre>

55

85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52

06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15

Such numbers can be included in the solution code, or read from a "triangle.txt" file.

This task is derived from the [http://projecteuler.net/problem=18 Euler Problem #18].

=={{header|Ada}}==

<lang ada>with Ada.Text_Io; use Ada.Text_Io;