aoc21
Advent-of-Code
aoc21 | Advent-of-Code | |
---|---|---|
4 | 42 | |
2 | 9 | |
- | - | |
0.0 | 8.6 | |
over 1 year ago | 4 months ago | |
Crystal | Python | |
- | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
aoc21
-
Advent of Code Day 24: Computing with Sets
The way I solved this was by squinting a little and realizing that every time a div instruction happened, then a certain number following it needed to be 0, depending on the value of certain constants embedded in the code, and also on certain other fields in the input. So instead of starting with an input number, it is possible to calculate the min and max values the fields may contain right there, as long as we embed the field positions in a stack.
As this is only going through the code once, this is virtually instantaneous and ended up as the day that was fastest of all days to compute.
https://github.com/yxhuvud/aoc21/blob/main/day24.cr
-
[2021] Solving AoC with Rust before Python can start
My solution, https://github.com/yxhuvud/aoc21/blob/main/all_days.cr :
-
Speeding up Dijkstra by a factor of 2700
Yes, though sometimes it is possible to replace a fully general priority queue with a faster structure that is using the structure of the problem at hand. For example, this problem (AoC day 15) has only ever a count of unique priorities that is 10 or fewer. That allows a queue implementation to be https://github.com/yxhuvud/aoc21/blob/main/day15.cr#L27-L51 , being amortized O(1) in both insertion and deletion. This pushed down the runtime another magnitude for me, the whole day running at 0.014s.
- -🎄- 2021 Day 18 Solutions -🎄-
Advent-of-Code
-
-❄️- 2023 Day 11 Solutions -❄️-
Fun one :D
-
-❄️- 2023 Day 10 Solutions -❄️-
Way trickier than I was expecting
-
-❄️- 2023 Day 9 Solutions -❄️-
:D
-
-❄️- 2023 Day 8 Solutions -❄️-
Classic LCM
-
-❄️- 2023 Day 7 Solutions -❄️-
Who wants spaghetti?
-
-❄️- 2023 Day 6 Solutions -❄️-
Much easier than yesterday's :D
-
-🎄- 2022 Day 12 Solutions -🎄-
195/242
-
-🎄- 2022 Day 11 Solutions -🎄-
Messy. Thankfully got part two pretty quickly recognizing that we can mod the worry level by the product of the test integers. Might refactor / clean this up tomorrow morning
-
-🎄- 2022 Day 10 Solutions -🎄-
2343 / 2119
-
-🎄- 2022 Day 6 Solutions -🎄-
Impressive how fast everyone was with this one today
What are some alternatives?
nom - Rust parser combinator framework
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
aoc
AdventOfCode-Java - adventOfCode(Language.JAVA);
AoC - my personal repo for the advent of code yearly challenge
Advent_of_Code_in_Pascal - My solutions to the Advent of Code, in Free Pascal
adventofcode - Solutions for problems from AdventOfCode.com
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
aoc2020 - Advent of Code 2020 - my answers
advent-of-code-2021 - 🎅🌟❄️☃️🎄🎁
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022
rockstar - The Rockstar programming language specification