On Monday, AdaCore will announce a new edition of the Advent of Ada/SPARK charity event. For each person completing one of the Advent of Code challenges using the Ada programming language, AdaCore will donate $10 to the Ada Developers Academy, up to a total of $5,000. And for those willing to go an extra mile, AdaCore will donate $20 if the solution is implemented in SPARK with at least proof of absence of run-time errors (a.k.a. Silver level).
Since there are fewer puzzles to solve this time, we decided to add a little bonus. For everyone who completes the full 12 puzzles, we add an extra $100 to the donation.
To submit your solutions, reply to this post with a line of the following format: [<pseudonym>][<day>][<Ada or SPARK>]<link to solution source code>
For instance, if I solve the 3rd day problem using Ada: [Fabien-Chouteau][3][Ada] https://github.com/Fabien-Chouteau/advent-of-ada/ …
And the 5th day using SPARK: [Fabien-Chouteau][5][SPARK] https://github.com/Fabien-Choutea/advent-of-ada/ …
Hummm, maybe I should release the « distance » library I develop, Even if it is in early stage, it contains the simple distance algorithme usualy Used in some exercices of AoC.
And, it is at least silver level proved
If you need to compute distance in challanges this year, like Manhattan, Euclidean, or text distance like Levenshtein, I just released a library for this purpose: Distance
It is still in dev, but all implemented algorithms work.