Advent of Code 2016 solutions https://adventofcode.com/2016/
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Chris Smith c4e384a63b Add TODO 2 years ago
data Day 25 2 years ago
01.py Move puzzle inputs to a subdir 2 years ago
02.py Move puzzle inputs to a subdir 2 years ago
03.py Move puzzle inputs to a subdir 2 years ago
04.py Move puzzle inputs to a subdir 2 years ago
05.py Style fixes 2 years ago
06.py Move puzzle inputs to a subdir 2 years ago
07.py Move puzzle inputs to a subdir 2 years ago
08.py Move puzzle inputs to a subdir 2 years ago
09.py Move puzzle inputs to a subdir 2 years ago
10.py Move puzzle inputs to a subdir 2 years ago
11.py Add module doc for some puzzles, tidy up. 2 years ago
12.py Add module doc for some puzzles, tidy up. 2 years ago
13.py Add module doc for some puzzles, tidy up. 2 years ago
14.py Add module doc for some puzzles, tidy up. 2 years ago
15.py Add module doc for some puzzles, tidy up. 2 years ago
16.py Add module doc for some puzzles, tidy up. 2 years ago
17.py Add module doc for some puzzles, tidy up. 2 years ago
18.py Code golf day 18 a little. 2 years ago
19.py Day 19 2 years ago
20.py Day 20 2 years ago
21.py Day 21 2 years ago
22.py Day 22 2 years ago
23.py Day 23 2 years ago
24.py Day 24. 2 years ago
25.py Add TODO 2 years ago
LICENCE.md Add readme and licence 2 years ago
README.md Add readme and licence 2 years ago

README.md

Advent of Code 2016

This repository contains my solution to 2016’s Advent of Code puzzles. The solutions are all written in Python 3; one or two may require the NumPy package, but the rest should work out-of-the-box.

I tend to focus on short, functional solutions where possible, so they may be a bit hard to read. Some solutions are commented to some degree to help with that.


To the extent possible under law, I waive all copyright and related or neighboring rights to this work. This work is published from the United Kingdom. See LICENCE.md for full details.