|
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;
with Ada.Integer_Text_Io; use Ada.Integer_Text_Io;
with Ada.Containers.Vectors;
procedure Max_Sum is
Triangle : array (Positive range <>) of integer :=
package Integer_Vectors is new Ada.Containers.Vectors
(55,
(Positive, Integer);
94, 48,
95, 30, 96,
Triangle : Integer_Vectors.Vector;
77, 71, 26, 67,
97, 13, 76, 38, 45,
Data : String :=
" 07, 36, 79, 55"&16, 37, 68,
" 48, 07, 09, 18, 9470, 48"&26, 06,
" 18, 72, 79, 46, 59, 9579, 3029, 96"&90,
" 20, 76, 87, 11, 32, 7707, 7107, 2649, 67"&18,
" 27, 83, 58, 35, 71, 11, 9725, 1357, 7629, 38 45"&85,
" 14, 64, 36, 96, 27, 11, 07 3658, 7956, 1692, 3718, 68"&55,
" 02, 90, 03, 60, 48, 49, 41, 48 07 0946, 1833, 7036, 2647, 06"&23,
" 92, 50, 48, 02, 36, 59, 42, 1879, 72, 7920, 46 59 7982, 2977, 90"&42,
" 56, 78, 38, 80, 39, 75, 02, 71, 2066, 7666, 8701, 1103, 3255, 07 07 49 18"&72,
" 44, 25, 67, 84, 71, 67, 11, 61, 2740, 8357, 58, 3589, 71 11 25 5740, 2956, 85"&36,
" 85, 32, 25, 85, 57, 48, 84, 35, 47, 1462, 6417, 3601, 9601, 2799, 1189, 58 56 92 18 55"&52,
" 06, 71, 28, 75, 94, 48, 37, 10, 23, 0251, 90 03 6006, 48, 4953, 4118, 4674, 3398, 36 47 23"&15,
27, "02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 50 48 02 36 59 4263, 7981, 7210, 2044, 8210, 7769, 42"&93);
" 56 78 38 80 39 75 02 71 66 66 01 03 55 72"&
Last : = Integer ( := Triangle .'Length ); ▼ " 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36"&
" 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"&
" 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93";
Num : Integer;
Last : Integer;
Index : Positive;
Tn : Integer := 1;
begin
Index := Data'First;
while Index < Data'Last loop
Get(Data(Index..Data'Last), Num, Last);
Triangle.Append(Num);
Index := Last+1;
end loop;
▲ Last := Integer(Triangle.Length);
while (Tn * (Tn + 1) / 2) < Last loop
Tn := Tn + 1;
for N in reverse 2 .. Tn loop
for I in 2 .. N loop
Triangle.Replace_Element (Last - N) := Triangle (Last - N) +
Integer'Max(Triangle (Last - N1), Triangle.Element (Last -N) +);
Integer'Max(Triangle.Element(Last-1), Triangle.Element(Last)));
Last := Last - 1;
end loop;
Last := Last - 1;
end loop;
Put_Line(Integer'Image(Triangle.Element(1)));
end Max_Sum;</lang>
</lang>
Output:
<pre> 1320
</pre>
=={{header|D}}==
<lang d>void main() {
|