adventofcode2021
advent_of_code
adventofcode2021 | advent_of_code | |
---|---|---|
5 | 19 | |
0 | 5 | |
- | - | |
0.0 | 8.0 | |
over 1 year ago | 3 months ago | |
C++ | Dart | |
- | GNU General Public License v3.0 only |
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.
adventofcode2021
-
Anyone using c++'s standard libraries for AOC?
I don't use a lot of things besides the STL, but I do like to mess around and roll out my own iterators to implement some algorithms. One or twice, I've used yacc/bison for parsing purposes. So, I don't know if it helps but if you want to have a look: https://github.com/lgeorget/adventofcode2020, https://github.com/lgeorget/adventofcode2021, etc.
-
how do you organize your C++ files for AOC in Eclipse?
In my case, I don't make a lot of efforts... my directory looks like this: https://github.com/lgeorget/adventofcode2021/tree/main/ (I have yet to finish the calendar by the way).
-
-🎄- 2021 Day 3 Solutions -🎄-
C++: https://github.com/lgeorget/adventofcode2021/tree/main/03
- -🎄- 2021 Day 2 Solutions -🎄-
- -🎄- 2021 Day 1 Solutions -🎄-
advent_of_code
-
-❄️- 2023 Day 9 Solutions -❄️-
Here's the relevant extract from my (recursive) solution. Full code on GitHub.
-
-❄️- 2023 Day 8 Solutions -❄️-
Like others, I used lcm. Here's an extract of the solution, omitting parsing and main(). Full solution on GitHub.
-
-🎄- 2022 Day 14 Solutions -🎄-
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.
-
-🎄- 2022 Day 10 Solutions -🎄-
Full code on github.
-
-🎄- 2022 Day 9 Solutions -🎄-
The core of my solution below using numpy (because I'm learning it!). See github for full code.
-
-🎄- 2022 Day 8 Solutions -🎄-
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].
-
-🎄- 2021 Day 14 Solutions -🎄-
Below is the new solution, which works for part 1 and 2. The full code is on GitHub.
-
-🎄- 2021 Day 11 Solutions -🎄-
These are the key functions. The whole code is on GitHub
-
-🎄- 2021 Day 9 Solutions -🎄-
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
-
-🎄- 2021 Day 8 Solutions -🎄-
Code is on GitHub.
What are some alternatives?
advent-of-code - My Advent of Code solutions through the years - mostly JS
advent-of-code
adventofcode2020 - Solutions for the Advent of Code 2020 challenge
AdventOfCode2021 - Solutions to all 25 AoC 2021 problems in Rust :crab: Less than 100 lines per day and under 1 second total execution time! :christmas_tree:
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
adventofcode - Solutions for problems from AdventOfCode.com
toit - Program your microcontrollers in a fast and robust high-level language.
adventofcode - Advent of Code Repo for Zach Attakk
advent-of-code - Advent Of Code Solutions
advent-of-code-2021
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
AoC - my personal repo for the advent of code yearly challenge