advent-of-code-2021 VS aoc

nice work! i had been trying to write zero alloc solutions when possible, but i had missed that it was possible on this one. here's my zig translation, it runs in about 15us on my m1 macbook / WSL 10850k. there are no iterators in zig so i had to write that myself, but i think my final solution reads reasonably well

Full code at GitHub.

Edit: you don't need to determine the type of hand, but you can directly compare the card counts. Second version @GitHub.

New version @GitHub.

So, a new version with a lot less almost-duplicate code @GitHub.

@GitHub

Completed part 2, see GitHub. I couldn't really use the same `DiracDice` class and simply use another `Die`, but had to create a separate `DiracDice2` class.Basically, just keep track of the possible universe state and their counts, and try all possible combinations of die rolls. Keep playing until all universes have a winner.

The rest is the same as my first attempt, but full code at GitHub.

I spent way too much time on this, but I completed my original attempt with the proper object model, see GitHub