Just needs a bit of formal languages theory, but otherwise the algorithm is fairly simple. Here’s my code if you decide to look at it at some point: https://github.com/hades/aoc2015/blob/master/dec19.cc
Christmas, I guess :) (I just pick a random colour each time a roll is removed)
Day 7 (zoom to full screen): https://lgbt.earth/i/web/post/903381501524320591
I can probably improve this a lot, but I was afraid I'll be too lazy after getting this far, so posting as is. Still, lmk if you have any suggestions :)
That's day 7, right?
Apart from day 4 not much to visualise so far this year :/
it all fit in int64 tho, so could be worse
constexpr u32 TEN = 10;
constexpr u64 TWELVE = 12;
I love the easter egg jokes you add to your code :)
Computer science is just mathematics, you can do it with pen and paper. The actual IT jobs where you don't have to touch windows are plentiful, although it might be a bit of a red flag if you're vehemently refusing to touch some specific software (be it windows, or any other program, or programming language).
so many years have passed since i last wrote a line of masm...
That’s a very interesting thought! I was thinking of writing my own Rust data type that would automatically upgrade to big integer, similarly to the int type in Python.