1.6 KiB
1.6 KiB
id | challengeType | title |
---|---|---|
5900f4601000cf542c50ff72 | 5 | Problem 244: Sliders |
Description
(S), (E)
For each path, its checksum is calculated by (pseudocode):
checksum = 0 checksum = (checksum × 243 + m1) mod 100 000 007 checksum = (checksum × 243 + m2) mod 100 000 007 … checksum = (checksum × 243 + mn) mod 100 000 007 where mk is the ASCII value of the kth letter in the move sequence and the ASCII values for the moves are:
L76R82U85D68
For the sequence LULUR given above, the checksum would be 19761398. Now, starting from configuration (S), find all shortest ways to reach configuration (T).
(S), (T)
What is the sum of all checksums for the paths having the minimal length?
Instructions
Tests
tests:
- text: <code>euler244()</code> should return 96356848.
testString: assert.strictEqual(euler244(), 96356848, '<code>euler244()</code> should return 96356848.');
Challenge Seed
function euler244() {
// Good luck!
return true;
}
euler244();
Solution
// solution required