🎄 Day 17
In Nim
At last, a hard day for the final day of Nim. I really had no idea how to solve this since ive never done any pathfinding/graphing problems before. I eventually found out i have to use Dijkstras algorithm for it.
To run part 1 or part 2, do:
$ make part1
$ make part2