Maximum path sum I

AUTHOR

Felix Herrmann

https://projecteuler.net/problem=18

By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.

    3
    7 4
    2 4 6
    8 5 9 3

That is, 3 + 7 + 4 + 9 = 23.

Find the maximum total from top to bottom of the triangle below:

75
    95 64
    17 47 82
    18 35 87 10
    20 04 82 47 65
    19 01 23 75 03 34
    88 02 77 73 07 63 67
    99 65 04 28 06 16 70 92
    41 41 26 56 83 40 80 70 33
    41 48 72 33 47 32 37 16 94 29
    53 71 44 65 25 43 91 52 97 51 14
    70 11 33 28 77 73 17 78 39 68 17 57
    91 71 52 38 17 14 91 43 58 50 27 29 48
    63 66 04 68 89 53 67 30 73 16 69 87 40 31
    04 62 98 27 23 09 70 98 73 93 38 53 60 04 23

NOTE: As there are only 16384 routes, it is possible to solve this problem by trying every route. However, Problem 67, is the same challenge with a triangle containing one-hundred rows; it cannot be solved by brute force, and requires a clever method! ;o)

use v6;



my $triangle =
    '75
    95 64
    17 47 82
    18 35 87 10
    20 04 82 47 65
    19 01 23 75 03 34
    88 02 77 73 07 63 67
    99 65 04 28 06 16 70 92
    41 41 26 56 83 40 80 70 33
    41 48 72 33 47 32 37 16 94 29
    53 71 44 65 25 43 91 52 97 51 14
    70 11 33 28 77 73 17 78 39 68 17 57
    91 71 52 38 17 14 91 43 58 50 27 29 48
    63 66 04 68 89 53 67 30 73 16 69 87 40 31
    04 62 98 27 23 09 70 98 73 93 38 53 60 04 23';

my @lines = string-to-array($triangle).reverse;

# reduce the triangle by adding up the lines until only one line with one
# element is left; then print it.
say "{@lines.reduce: &add-maxima}";

# this function assumes the shorter and longer array to be consecutive lines
# in an reversed triangle. It then adds each of the maxima of consecutive fields
# of the longer array to their shared diagonal neighbour in the shorter array.
sub add-maxima(@longer, @shorter is copy) {
    for 0 .. @longer - 2 -> $i {
        @shorter[$i] += max @longer[$i], @longer[$i + 1];
    }
    return @shorter;
}

sub string-to-array($string) {
    my @lines = $string.lines;
    @lines .= map(-> $line { $line.comb(/\d+/).item });
}

# vim: expandtab shiftwidth=4 ft=perl6

See Also

prob001-cspencer.raku

Multiples of 3 and 5

prob001-eric256.raku

Multiples of 3 and 5

prob001-grondilu.raku

Multiples of 3 and 5

prob001-hexmode.raku

Multiples of 3 and 5

prob001-unobe.raku

Multiples of 3 and 5

prob002-eric256.raku

Even Fibonacci numbers

prob002-gerdr.raku

Even Fibonacci numbers

prob002-hexmode.raku

Even Fibonacci numbers

prob003-eric256.raku

Largest prime factor

prob003-gerdr.raku

Largest prime factor

prob003-hexmode.raku

Largest prime factor

prob003-lanny.raku

Largest prime factor

prob004-unobe.raku

Largest palindrome product

prob004-xfix.raku

Largest palindrome product

prob005-unobe.raku

Smallest multiple

prob005-xfix.raku

Smallest multiple

prob006-polettix.raku

Sum square difference

prob007-polettix.raku

10001st prime

prob008-duff.raku

Largest product in a series

prob008-duff2.raku

Largest product in a series

prob009-gerdr-feeds.raku

Special Pythagorean triplet

prob009-gerdr.raku

Special Pythagorean triplet

prob009-polettix.raku

Special Pythagorean triplet

prob010-polettix.raku

Summation of primes

prob011-moritz.raku

Largest product in a grid

prob012-polettix.raku

Highly divisible triangular number

prob013-grondilu.raku

Large sum

prob014-felher.raku

Longest Collatz sequence

prob015-felher.raku

Lattice paths

prob016-grondilu.raku

Power digit sum

prob017-duff.raku

Number letter counts

prob019-grondilu.raku

Counting Sundays

prob020-grondilu.raku

Factorial digit sum

prob021-gerdr.raku

Amicable numbers

prob022-grondilu.raku

Names scores

prob023-shlomif.raku

Non-abundant sums

prob024-moritz.raku

Lexicographic permutations

prob025-polettix.raku

1000-digit Fibonacci number

prob026-shlomif.raku

Reciprocal cycles

prob027-shlomif.raku

Quadratic primes

prob028-shlomif.raku

Number spiral diagonals

prob029-gerdr.raku

Distinct powers

prob029-polettix.raku

Distinct powers

prob031-shlomif.raku

Coin sums

prob033-andreoss.raku

Digit cancelling fractions

prob034-quinny.raku

Digit factorials

prob036-xenu.raku

Double-base palindromes

prob038-andreoss.raku

Pandigital multiples

prob039-quinny.raku

Integer right triangles

prob041-heyajulia-alternative.raku

Pandigital Prime

prob041-heyajulia.raku

Pandigital Prime

prob042-shlomif.raku

Coded triangle numbers

prob047-gerdr.raku

Distinct primes factors

prob052-duff.raku

Permuted multiples

prob053-duff.raku

Combinatoric selections

prob053-gerdr.raku

Combinatoric selections

prob054-andreoss.raku

Poker hands

prob055-shlomif.raku

Lychrel numbers

prob056-shlomif.raku

prob059-andreoss.raku

XOR decryption

prob063-moritz.raku

Powerful digit counts

prob063-polettix.raku

Powerful digit counts

prob065-andreoss.raku

Convergents of e

prob065-grondilu.raku

prob066-andreoss.raku

Diophantine equation

prob067-felher.raku

Maximum path sum II

prob080-andreoss.raku

Square root digital expansion

prob081-moritz.raku

Path sum: two ways

prob089-andreoss.raku

Roman numerals

prob092-moritz.raku

Square digit chains

prob097-andreoss.raku

Large non-Mersenne prime

prob098-andreoss.raku

Anagramic squares

prob099-andreoss.raku

Largest exponential

README.md

The Camelia image is copyright 2009 by Larry Wall. "Raku" is trademark of the Yet Another Society. All rights reserved.

Built with Podlite — the markup and publishing tools behind this site.