aoc2021
AdventOfCode2021
aoc2021 | AdventOfCode2021 | |
---|---|---|
11 | 19 | |
1 | 11 | |
- | - | |
0.0 | 4.2 | |
over 2 years ago | over 2 years ago | |
Python | C++ | |
- | Apache License 2.0 |
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.
aoc2021
-
[2021 Day 24][Python] A brute-force solution in 170 seconds
With only a few small restrictions down from "fully general", I have a brute-force-ish solution in python running in about 15 seconds on my hardware and my input: https://github.com/fizbin/aoc2021/blob/main/aoc24b.py
-
Happy New Year guys! I want to share my recap of Advent of Code 2021, I hope this is allowed.
With day 22, I actually have three different python approaches in my repo; the inclusion/exclusion approach is what I named aoc22c.py.
-
[2021 Day 24] I may have done something clever, I wonder if anyone else used this approach
This sounds vaguely similar to the approach I took on my second python solution, minus one optimization that I used: namely, I determined the maximum allowable value of "z" at the end of each instruction if we were going to end the program with z=0 and used that to throw away states that weren't worth pursuing.
-
2021 Day 22 (Part 2) This algorithm may not be optimal
I've implemented that approach, and my code to do so takes less than five seconds on my machine, so I wonder: have you tried this on the sample input? What does it do there?
- What have been the most computationally complex puzzles over the years (i.e. takes most runtime to complete)?
-
-🎄- 2021 Day 22 Solutions -🎄-
How about a python translation of my haskell solution?
-
Advent of Code 2021 day 22
My solution in my github repo
-
Advent of Code 2021 day 21
Here's the more straightforward Monad-based solution, which unfortunately takes well over a minute to run.
- -🎄- 2021 Day 16 Solutions -🎄-
AdventOfCode2021
- -🎄- 2021 Day 22 Solutions -🎄-
- -🎄- 2021 Day 21 Solutions -🎄-
- -🎄- 2021 Day 20 Solutions -🎄-
- -🎄- 2021 Day 18 Solutions -🎄-
- -🎄- 2021 Day 17 Solutions -🎄-
- -🎄- 2021 Day 16 Solutions -🎄-
-
-🎄- 2021 Day 15 Solutions -🎄-
https://github.com/willkill07/AdventOfCode2021/blob/main/days/Day15.cpp https://github.com/willkill07/AdventOfCode2021/blob/main/days/Day15.hpp
- -🎄- 2021 Day 14 Solutions -🎄-
- -🎄- 2021 Day 13 Solutions -🎄-
- -🎄- 2021 Day 12 Solutions -🎄-
What are some alternatives?
aoc-2021 - AOC challenge in Haskell
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
advent_of_code - :christmas_tree: Advent of Code 2021 in Kotlin :christmas_tree:
adventofcode - https://adventofcode.com/2021/
Advent_of_code_2021 - Rust solutions for advent of code 2021
roast - 🦋 Raku test suite
advent-of-code
deno_aoc - 🎄 Advent of code solutions written in TypeScript for Deno.
adventofcode - Answers to Advent of Code
Advent-of-code-2021 - [Moved to: https://github.com/Toanuvo/Advent-of-code]
Advent_of_Code_in_Pascal - My solutions to the Advent of Code, in Free Pascal
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022