1.3 KiB
1.3 KiB
id | challengeType | title | forumTopicId |
---|---|---|---|
5900f3be1000cf542c50fed1 | 5 | Problem 82: Path sum: three ways | 302196 |
Description
\begin{pmatrix}
131 & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\
\color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\
630 & 803 & 746 & 422 & 111\\
537 & 699 & 497 & 121 & 956\\
805 & 732 & 524 & 37 & 331
\end{pmatrix}
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.
Instructions
Tests
tests:
- text: <code>euler82()</code> should return 260324.
testString: assert.strictEqual(euler82(), 260324);
Challenge Seed
function euler82() {
// Good luck!
return true;
}
euler82();
Solution
// solution required