aoc21
Advent_of_Code_in_Pascal
aoc21 | Advent_of_Code_in_Pascal | |
---|---|---|
4 | 23 | |
2 | 8 | |
- | - | |
0.0 | 0.0 | |
over 1 year ago | over 1 year ago | |
Crystal | Pascal | |
- | - |
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_in_Pascal
-
Advent of Code 2022
I'm doing it in Lazarus/Free Pascal again.
https://github.com/mikewarot/Advent_of_Code_in_Pascal
-
-🎄- 2021 Day 22 Solutions -🎄-
Free Pascal - 2251/1744 34.5 seconds runtime No objects, no recursion After brute forcing part 1, I stared at part 2 until I though only handling the different values of X,Y,Z and letting the grid represent variable size cubes.. only to hit memory size limits anyway... and then I learned how to use BITPACKED array, and was able to eventually brute force part 2. Whew!
-
-🎄- 2021 Day 21 Solutions -🎄-
Pascal 2235/4609
-
-🎄- 2021 Day 18 Solutions -🎄-
Pascal - Github
-
-🎄- 2021 Day 16 Solutions -🎄-
Pascal 7079/6330 - github
-
-🎄- 2021 Day 15 Solutions -🎄-
Github - https://github.com/mikewarot/Advent_of_Code_in_Pascal/blob/master/2021/advent2021_15b.lpr
-
day 13 result issue, someone can help?
My pascal based solver eventually got valid text out of your input.
- -🎄- 2021 Day 13 Solutions -🎄-
-
-🎄- 2021 Day 9 Solutions -🎄-
Pascal 2437/6187
-
-🎄- 2021 Day 8 Solutions -🎄-
Pascal 3590/5744
What are some alternatives?
nom - Rust parser combinator framework
mORMot2 - OpenSource RESTful ORM/SOA/MVC Framework for Delphi and FreePascal
Advent-of-Code - Advent of Code
aoc2020 - Advent of Code 2020 - my answers
aoc
advent-of-code - My solutions for Advent of Code
aoc-2020 - Advent of Code 2020
advent-of-code-2020 - 🎅🌟❄️☃️🎄🎁
advent-of-code-2020 - Answers and solutions for Advent of Code 2020.
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
advent-of-code-2021 - My solutions for the "Advent of Code 2021"