This project provides solutions to the Advent of Code 2015.
You can run the solutions via SBT.
First, compile the solutions:
$ sbt compile
Then, you can run the solution to a specific problem. For instance, to run the solution for the part 1 of day 1:
$ sbt "runMain aoc.day01.Part1" < src/main/resources/day01/input
To run the solution for the part 2 of day 1:
$ sbt "runMain aoc.day01.Part2" < src/main/resources/day01/input
- Day 1: Not Quite Lisp
- Day 2: I Was Told There Would Be No Math
- Day 3: Perfectly Spherical Houses in a Vacuum
- Day 4: The Ideal Stocking Stuffer
- Day 5: Doesn't He Have Intern-Elves For This?
- Usage of regular expressions and backreferences
- Day 6: Probably a Fire Hazard
- Day 7: Some Assembly Required
- Day 8: Matchsticks
- Day 9: All in a Single Night
- Brute force approach
- Day 10: Elves Look, Elves Say
- Day 11: Corporate Policy
- Usage of regular expressions and backreferences
- Day 12: JSAbacusFramework.io
- Usage of spray.json library
- Day 13: Knights of the Dinner Table
- Similar approach to day 9
- Day 14: Reindeer Olympics
- Day 15: Science for Hungry People
- Day 16: Aunt Sue
- Day 17: No Such Thing as Too Much
- Day 18: Like a GIF For Your Yard
- Day 19: Medicine for Rudolph
- Part 2 implements a solution using an A* algorithm
- Day 20: Infinite Elves and Infinite Houses
- Solutions runs slowly.
- Day 21: RPG Simulator 20XX
- Day 22: Wizard Simulator 20XX
- Day 23: Opening the Turing Lock
- Day 24: It Hangs in the Balance
- This solution proceeds by building a first group by ascending size and by ascending quantum entanglement. Then it checks that the other groups can be built so that all groups have the same weight.
- It takes a few seconds to compute the solution
- Day 25: Let It Snow
GPLv3 - see the COPYING file.