advent-2021
Our great sponsors
advent-2021 | AdventOfCode2021 | |
---|---|---|
19 | 12 | |
5 | 1 | |
- | - | |
6.8 | 2.6 | |
over 1 year ago | over 2 years ago | |
Rust | Perl | |
- | - |
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.
advent-2021
- -🎄- 2021 Day 24 Solutions -🎄-
- -🎄- 2021 Day 23 Solutions -🎄-
-
-🎄- 2021 Day 22 Solutions -🎄-
Rust https://github.com/Crazytieguy/advent-2021/blob/master/src/bin/day22/main.rs Imagining the geometry of this was very tricky for me. For a while I contemplated if calculating the intersection of each pair of cuboids would give me enough information to know how many cubes are on at the end, and finally decided that I would also have to calculate the intersections of those and so on, so I gave up. Instead I decided that my state will be a vector of cuboids that are garuanteed to be non overlapping, and on each command I would subtract the current cuboid from each of these non overlapping cuboids (leaving 1 to 6 cuboids depending on intersection), and finally either add in the current cuboid (for on command) or leave it out (for off).
- -🎄- 2021 Day 21 Solutions -🎄-
- -🎄- 2021 Day 20 Solutions -🎄-
- -🎄- 2021 Day 19 Solutions -🎄-
- -🎄- 2021 Day 18 Solutions -🎄-
- -🎄- 2021 Day 16 Solutions -🎄-
- -🎄- 2021 Day 15 Solutions -🎄-
- -🎄- 2021 Day 14 Solutions -🎄-
AdventOfCode2021
-
-🎄- 2021 Day 18 Solutions -🎄-
Full program on GitHub.
-
-🎄- 2021 Day 15 Solutions -🎄-
Full program including code to deal with heaps, on GitHub.
-
[2021 Day 11 (Part 2)] What input takes the most steps to synchronize?
Program I used for the above results
-
-🎄- 2021 Day 8 Solutions -🎄-
See my solution on GitHub.
-
Day 6 Proof of Correctness
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).
-
-🎄- 2021 Day 6 Solutions -🎄-
Based on my matrix exponentiation solution, here is a closed-form solution:
-
How do I read today's input ? Part 1
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.
-
2021 Day #4 (Part 1) [Native Python ONLY] - Conceptual Guidance?
I considered doing that for my (Perl) solution, but given the cards are small, that seemed overkill.
-
-🎄- 2021 Day 4 Solutions -🎄-
Python implementation on GitHub
What are some alternatives?
aoc2021 - Advent of Code 2021 - my answers
Elixir - Elixir is a dynamic, functional language for building scalable and maintainable applications
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022
Advent-of-code - My solutions of adventofcode.com
aoc2021 - Advent of Code 2021 on my homemade 16-bit CPU SCAMP
Advent_of_Code_2021_Solutions_Java - Personal AoC/2021 Solutions in Java
deno_aoc - 🎄 Advent of code solutions written in TypeScript for Deno.
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
aoc - Advent of Code - mscha's Perl 6 solutions
adventofcode - Advent of Code challenge solutions
AdventOfCode2021.jl - Advent of Code 2021 in Julia
adventofcode - Solutions for problems from AdventOfCode.com