1.3 KiB
1.3 KiB
id | challengeType | title |
---|---|---|
5900f3bd1000cf542c50fed0 | 5 | Problem 81: Path sum: two ways |
Description
\begin{pmatrix}
\color{red}{131} & 673 & 234 & 103 & 18\\
\color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\
630 & 803 & \color{red}{746} & \color{red}{422} & 111\\
537 & 699 & 497 & \color{red}{121} & 956\\
805 & 732 & 524 & \color{red}{37} & \color{red}{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 top left to the bottom right by only moving right and down.
Instructions
Tests
tests:
- text: <code>euler81()</code> should return 427337.
testString: assert.strictEqual(euler81(), 427337, '<code>euler81()</code> should return 427337.');
Challenge Seed
function euler81() {
// Good luck!
return true;
}
euler81();
Solution
// solution required