advent-of-code-my-solutions VS AdventOfCode2021

https://github.com/ColasNahaboo/advent-of-code-my-solutions for the 2021 version, so that year is technically possible too...

My repo, with comments: https://github.com/ColasNahaboo/advent-of-code-my-solutions/tree/main/bash/2021

As I see there is no bash solution yet, here is mine: https://github.com/ColasNahaboo/advent-of-code-my-solutions/blob/main/bash/2021/days/d06-1.sh Runs in less than 100ms. It is a linear solution with bins, but the bins are not based on the fishes timers. There is a bin for each day, with the number of timers reaching zero ==> fishes born on the next day.

Full program on GitHub.

Full program including code to deal with heaps, on GitHub.

Program I used for the above results

See my solution on GitHub.

Note also that you can solve this without a complexity dependency on n. Most solutions I have seen, including mine run in time O(tD), where t is the maximum value of a timer, and D the number of generation, requiring O(t) memory. (This is assuming we can do the required arithmetic operations in constant time, and each numbers require a fixed around of memory storage; if the number of fish gets huge, throw in an additional log n in the complexities, where n is the number of fish on the final day).

Based on my matrix exponentiation solution, here is a closed-form solution:

In my Perl solution of today (I assume, you mean 2021, Day 4), I read stuff in paragraph mode ($/ = "") which makes Perl split input on 2 or more newlines.

I considered doing that for my (Perl) solution, but given the cards are small, that seemed overkill.

Python implementation on GitHub