Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Path sum: three ways #95

Open
mattgathu opened this issue Sep 3, 2018 · 0 comments
Open

Path sum: three ways #95

mattgathu opened this issue Sep 3, 2018 · 0 comments

Comments

@mattgathu
Copy link
Contributor

mattgathu commented Sep 3, 2018

Problem Number: 82

NOTE: This problem is a more challenging version of Problem 81.
The minimal path sum in the 5 by 5 matrix below, by starting in any cell in the left column and finishing in any cell in the right column, and only moving up, down, and right, is indicated in red and bold; the sum is equal to 994.

screen shot 2018-09-04 at 00 35 03

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

Ref

https://projecteuler.net/problem=82

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant