AdventOfCode2020
My solutions for Advent of Code 2020 in Python. I try to write solutions as elegant, readable and Pythonic as possible. (by 0xVector)
Advent_of_Code_in_Pascal
My solutions to the Advent of Code, in Free Pascal (by mikewarot)
AdventOfCode2020 | Advent_of_Code_in_Pascal | |
---|---|---|
2 | 23 | |
7 | 8 | |
- | - | |
0.0 | 0.0 | |
over 2 years ago | over 1 year ago | |
Python | Pascal | |
- | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
AdventOfCode2020
Posts with mentions or reviews of AdventOfCode2020.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2020-12-23.
-
-🎄- 2020 Day 24 Solutions -🎄-
Python, simple and (hopefully) readable.
-
2020 Day 21 Solutions
Set-based solution in Python.
Advent_of_Code_in_Pascal
Posts with mentions or reviews of Advent_of_Code_in_Pascal.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-11-30.
-
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