← Complete problem index

PROJECT EULER · #0081

Path Sum: Two Ways

Statement only · SolvedOriginal problem ↗

In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by only moving to the right and down, is indicated in bold red and is equal to 2427.

(131673234103182019634296515063080374642211153769949712195680573252437331)

Find the minimal path sum from the top left to the bottom right by only moving right and down in matrix.txt (right click and "Save Link/Target As..."), a 31K text file containing an 80 by 80 matrix.

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.