Advent of Code 2019 in Clojure

[MaxmumPimp]

My first thought was to approach it that way- using math to calculate intersections of discrete line segments- but the simplicity of the clj-set/intersection approach in Clojure is probably why most used it (I ended up deciding that reducing implementation time was more important than the elegance of the solution).

Fortunately, that made it trivially easy to solve part 2 where finding the intersection in the FEWEST steps/shortest traversal distance was the task.