1.3 KiB
1.3 KiB
id | challengeType | title |
---|---|---|
5900f4a61000cf542c50ffb8 | 5 | Problem 313: Sliding game |
Description
Let S(m,n) represent the minimum number of moves to complete the game on an m by n grid. For example, it can be verified that S(5,4) = 25.
There are exactly 5482 grids for which S(m,n) = p2, where p < 100 is prime.
How many grids does S(m,n) = p2, where p < 106 is prime?
Instructions
Tests
tests:
- text: <code>euler313()</code> should return 2057774861813004.
testString: assert.strictEqual(euler313(), 2057774861813004, '<code>euler313()</code> should return 2057774861813004.');
Challenge Seed
function euler313() {
// Good luck!
return true;
}
euler313();
Solution
// solution required