archive
/
aoc-2018
Watch 1
Star 0
Fork 0
Code Issues 0 Pull Requests 0 Releases 0 Wiki Activity
My solutions to 2018's advent of code
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.
This repo is archived. You can view files and clone it, but cannot push or open issues/pull-requests.
11 Commits
1 Branch
Tree: 665f0309b3
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '665f0309b3'
${ noResults }
Chris Smith 665f0309b3 Day 1 in nim 5 years ago
data Day 5 5 years ago
docker Day 1 in nim 5 years ago
.gitignore Day 1 in nim 5 years ago
01.py Appease Shane. 5 years ago
02.py Appease Shane. 5 years ago
03.py Performance improvements 5 years ago
04.py Day 4 5 years ago
05.py Day 5 5 years ago
LICENCE.md Day 1 5 years ago
README.md Appease Shane. 5 years ago
day01.nim Day 1 in nim 5 years ago
run.sh Day 1 in nim 5 years ago

README.md

Advent of Code 2018

This repository contains my solution to 2018’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 previous years:

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.