archive
/
aoc-2017
Segui 1
Vota 0
Forka 0
Codice Problemi 0 Pull Requests 0 Rilasci 0 Wiki Attività
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.
43 Commit
1 Ramo (Branch)
Ramo (Branch): master
Rami (Branch) Tag
${ item.name }
Crea branch ${ searchTerm }
da 'master'
${ noResults }
Chris Smith e9ef83f514 Day 25 6 anni fa
data Day 25 6 anni fa
docker Docker docker docker docker docker 6 anni fa
.gitignore Day 14 6 anni fa
01.py f-strings 6 anni fa
02.py f-strings 6 anni fa
03.py Unsatisfying day 3. 6 anni fa
04.py Day 4. 6 anni fa
05.py Day 5. 6 anni fa
06.py Day 6. 6 anni fa
07.py Minor day 7 tidying 6 anni fa
08.py Day 8 6 anni fa
09.py Day 9. 6 anni fa
10.py Day 14 6 anni fa
11.py Simplify a little. 6 anni fa
12.py Day 14 6 anni fa
13.py Quick and dirty day 13 6 anni fa
14.py Further optimise day 14. 6 anni fa
15.py Starmap! 6 anni fa
16.py Reduce instead of iterating. 6 anni fa
17.py Day 17. 6 anni fa
18.py Tidy 18 a little. 6 anni fa
19.py Optimise junction handling slightly. 6 anni fa
20.py Day 20. 6 anni fa
21.py Day 21 6 anni fa
22.py Day 22. 6 anni fa
23.py Manual day 23 6 anni fa
24.py 24 6 anni fa
25.py Day 25 6 anni fa
LICENCE.md README and LICENCE. 6 anni fa
README.md Docker docker docker docker docker 6 anni fa
run.sh Docker docker docker docker docker 6 anni fa
shared.py Day 14 6 anni fa

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.