rusty-aoc VS AdventOfCode

My rusty-aoc repo & today' solution here.

Got my 100th 🦀 rusty ⭐🌟 star 🌠✨ today for 🎄 Xmas 🎅 (my code) 🎉. I had a rough time at first with converting SNAFU back to decimal so I first did things by hand (and a website to get numbers in base 5).

My rust code (43mn for part 1 ; +1h33 for part 2) with a topological sort thanks to the crate petgraph.

Rust, I used Linear Programming too, after I did not found reasonable pruning methods on the search tree. My code is there. I never did LP before, only heard of it, so yesterday was a long day!

Mine in rust too is there: https://github.com/Philippe-Cholet/rusty-aoc/blob/main/aoc2022/day09/src/lib.rs

I use itertools::Itertools which have a nice all_unique (internally, it creates a hashset and insert elements one by one unless it already contains it) but if I really wanted efficiency, I would manage my own hashset because this method is called for each character.

Today, I rewrote it multiple times before I liked a version enough to commit it and push it to my repo. I probably won't rewrite it that many times in a few days once the problem is more "interesting".

Code: main (445b314)

Edit: Made some of those improvements. Have a look at main. Want the original code? Check out commit c6ae21b

Code: main (de0beb6)

Code: main (5f0a9a8)

For part 1 my sneaky elves took a step north and then walked around the outside of the blizzard field. I trapped them in with additional walls \evil grin**

Python [762/731]

Python+Paper [1740/765]

Python+sympy [204/1353]

Python [213/499]

Version at time of posting: 492376c (since I've committed since then)