Really wanna try out agda during this year's AoC, but I'm a little bit too scared to do IO and parsing in a proof assistant. I don't think that implementing a recurse decent parsing library would be too hard but it's also pretty busy right now so maybe I'll attempt that later in the challenge (if I can keep it up this year).
So for lack of better languages, more Haskell this year.
So similar to last year, a different language each day. Different though: I pick the language myself instead of using the little seeded ransomizer. Hopefully this helps with me finishing it when I am busy that day (by picking a language I already know).
This is the first time I'm actually attempting to finish the advent of code, so make sure I keep my promises! This is going to be difficult since I'm going to be offline from the 21st. Time to do manual calculus and programming without the internet™
Anyway I'm trying to do this polyglot, but only as many languages as possible instead of the correct language lol.
