Solutions to Advent of Code 2017 https://adventofcode.com/2017/
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 e9ef83f514 Day 25 3 years ago
data Day 25 3 years ago
docker Docker docker docker docker docker 3 years ago
.gitignore Day 14 3 years ago
01.py f-strings 3 years ago
02.py f-strings 3 years ago
03.py Unsatisfying day 3. 3 years ago
04.py Day 4. 3 years ago
05.py Day 5. 3 years ago
06.py Day 6. 3 years ago
07.py Minor day 7 tidying 3 years ago
08.py Day 8 3 years ago
09.py Day 9. 3 years ago
10.py Day 14 3 years ago
11.py Simplify a little. 3 years ago
12.py Day 14 3 years ago
13.py Quick and dirty day 13 3 years ago
14.py Further optimise day 14. 3 years ago
15.py Starmap! 3 years ago
16.py Reduce instead of iterating. 3 years ago
17.py Day 17. 3 years ago
18.py Tidy 18 a little. 3 years ago
19.py Optimise junction handling slightly. 3 years ago
20.py Day 20. 3 years ago
21.py Day 21 3 years ago
22.py Day 22. 3 years ago
23.py Manual day 23 3 years ago
24.py 24 3 years ago
25.py Day 25 3 years ago
LICENCE.md README and LICENCE. 3 years ago
README.md Docker docker docker docker docker 3 years ago
run.sh Docker docker docker docker docker 3 years ago
shared.py Day 14 3 years ago

README.md

Advent of Code 2017

This repository contains my solution to 2017’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.

If you have docker installed, simply execute run.sh to build a docker image and execute the latest solution using pypy3. You can specify other days by passing the script names as arguments (e.g. run.sh 03.py).

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.

I have separate repositories for solutions from 2016 and 2015.


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.