project_euler.problem_081.sol1

Problem 81: https://projecteuler.net/problem=81 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.

[131] 673 234 103 18 [201] [96] [342] 965 150

630 803 [746] [422] 111 537 699 497 [121] 956 805 732 524 [37] [331]

Find the minimal path sum from the top left to the bottom right by only moving right and down in matrix.txt (https://projecteuler.net/project/resources/p081_matrix.txt), a 31K text file containing an 80 by 80 matrix.

Functions

solution(→ int)

Returns the minimal path sum from the top left to the bottom right of the matrix.

Module Contents

project_euler.problem_081.sol1.solution(filename: str = 'matrix.txt') → int

Returns the minimal path sum from the top left to the bottom right of the matrix. >>> solution() 427337