aoc VS advent_of_code

Personally I just stick to raw arrays for most days, usually with static storage (so pre-allocated). Keeps things simple! Here's my repo.

- C -

Here's my solution. Sorry, I did go a bit overboard making it compact.

That was one heck of a tough day but also very satisfying. I spent quite some time working out a 3D rectangle splitting/merging algorithm on paper and then I had to go and implement that in C. It turned out pretty clean and idiomatic, if I may say so!

This was my first attempt (or at least in a very long time) at generating video. Here I'm generating raw RGB frames in memory and writing them to ffmpeg, which works well enough but it's a little primitive.

At 50 year sold and very stable, C must be one of the easiest languages to get working on old machines. Required just some of the polyfills I wrote back in 2020.

My original solution checked every character against every other character, which performed perfectly fine even for 14 chars, but it felt wrong.

- C -

First a straightforward solution with a double buffer, later realised you could do it in-place by just holding onto one value per row/column.

First wrote a short AWK program to convert the input to C and play with it while running a hopeless brute force attempt.

Here's the relevant extract from my (recursive) solution. Full code on GitHub.

Like others, I used lcm. Here's an extract of the solution, omitting parsing and main(). Full solution on GitHub.

Solutions to parts 1 and 2 nearly identical and pretty much worked first time. Nothing clever here. This was far simpler than I thought it would be. I probably spent most time trying to think of a mathematical way of getting all points between p1 and p2. In the end, I just constructed two ranges. Full code here.

Full code on github.

The core of my solution below using numpy (because I'm learning it!). See github for full code.

Python 3 solution using numpy. I got held up because I assume (but know better) that numpy arrays are [x,y] instead of [row, col], which is [y,x].

Below is the new solution, which works for part 1 and 2. The full code is on GitHub.

These are the key functions. The whole code is on GitHub

Part 2 (extract shown below) was a matter of starting with the low points found in part 1 then recursively looking around for relevant points. Full code on GitHub

Code is on GitHub.