blog
My blog. (by gaverhae)
Advent_of_Code_in_Pascal
My solutions to the Advent of Code, in Free Pascal (by mikewarot)
blog | Advent_of_Code_in_Pascal | |
---|---|---|
1 | 23 | |
1 | 8 | |
- | - | |
9.6 | 0.0 | |
15 days ago | over 1 year ago | |
Clojure | Pascal | |
GNU General Public License v3.0 or later | - |
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.
blog
Posts with mentions or reviews of blog.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2020-12-22.
-
-🎄- 2020 Day 23 Solutions -🎄-
If you really want speed, you'll need to drop to Java arrays. Overall, your approach is based on a map from cup value (a long) to next cup value (a long). Clojure maps are great for many things, but if you need a fast representation of a mapping from integer to integer, the best option is a Java array. For me, switching from a map-based implementation to an array-based one reduced the time it take for part 2 from ~48s to ~4s.
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
What are some alternatives?
When comparing blog and Advent_of_Code_in_Pascal you can also consider the following projects:
adventofcode - Solutions for Advent of Code over the years
mORMot2 - OpenSource RESTful ORM/SOA/MVC Framework for Delphi and FreePascal
advent-of-code - Solutions to Advent of Code puzzles.
aoc2020 - Advent of Code 2020 - my answers
aoc20
advent-of-code - My solutions for Advent of Code
aoc-2020 - Advent of Code 2020
AoC - my personal repo for the advent of code yearly challenge
advent-of-code-2020 - 🎅🌟❄️☃️🎄🎁
aoc-2020 - My solutions to Advent of Code 2020.
Advent-of-Code - Advent of Code
blog vs adventofcode
Advent_of_Code_in_Pascal vs mORMot2
blog vs advent-of-code
Advent_of_Code_in_Pascal vs aoc2020
blog vs aoc20
Advent_of_Code_in_Pascal vs advent-of-code
blog vs aoc2020
Advent_of_Code_in_Pascal vs aoc-2020
blog vs AoC
Advent_of_Code_in_Pascal vs advent-of-code-2020
blog vs aoc-2020
Advent_of_Code_in_Pascal vs Advent-of-Code