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: four ways #96

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

Path sum: four ways #96

mattgathu opened this issue Sep 3, 2018 · 0 comments

Comments

@mattgathu
Copy link
Contributor

mattgathu commented Sep 3, 2018

Problem Number: 83

NOTE: This problem is a significantly more challenging version of Problem 81.
In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by moving left, right, up, and down, is indicated in bold red and is equal to 2297.

screen shot 2018-09-04 at 10 06 22

Find the minimal path sum, in matrix.txt, a 31K text file containing a 80 by 80 matrix, from the top left to the bottom right by moving left, right, up, and down.

Ref

https://projecteuler.net/problem=83

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