You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: 2024/Day20/README.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -9,7 +9,7 @@ The problem included a small but crucial hint: _there is only a single path from
9
9
10
10
The definition of _cheating_ was super hard to understand. I have to admit that instead, I used my intuition and used a more simple definition: in cheat mode you can step to any cell within the distance of 2 (or 20 for the second part). This really worked.
11
11
12
-
I created a function that returns the points of the track from finish to start. This way, the _index_ of an item in the array corresponds to its distance to the finish line.
12
+
I created a function that returns the points of the track in finish to start order. This way, the _index_ of an item in the array corresponds to its distance to the finish line.
13
13
14
14
Then, I go over the path. For each position, the number of possible cheats is calculated by checking what happens if we are trying to make a shortcut to any other positions around.
0 commit comments