bert/adventofcode
1
0
Fork 0
mirror of https://github.com/bertptrs/adventofcode.git synced 2025-12-25 21:00:31 +01:00
Code Issues Projects Releases Wiki Activity
837 Commits 5 Branches 0 Tags
7e23cf94a648ea769e46b3eb9e9e7fa7a39ac983
Commit Graph

837 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
Bert Peters
1d6edda98b Actually commit the implementation. 2018-11-13 11:54:56 +01:00
Bert Peters
be8be856ac Implement day 16. 2018-11-13 11:51:43 +01:00
Bert Peters
8910dbe072 Generify gcd/lcm. 2018-11-12 15:52:21 +01:00
Bert Peters
6ad8f4cb56 Implement day 15 of 2016. 2018-11-12 15:22:37 +01:00
Bert Peters
42d075f8f4 Update 2018 skeleton. 2018-11-12 13:18:16 +01:00
Bert Peters
9aff05d296 Rewrite old code into 2018 style. 
Nice test for my 2018 repo set up. Which turns out needs some tweaking.
 2018-11-12 13:13:03 +01:00
Bert Peters
71eb13f52d Set up for AoC 2018. 2018-11-09 16:11:08 +01:00
Bert Peters
7e9dff9be6 Add a script to time all days. 2018-01-27 22:25:25 +01:00
Bert Peters
fc2c0e245d Makefile for automated running of swift. 2018-01-27 22:24:49 +01:00
Bert Peters
a751456596 Fix Haskell compilation on Arch Linux. 2017-12-27 19:10:40 +01:00
Bert Peters
2939822329 Add missing input for day 14. 2017-12-27 13:45:27 +01:00
Bert Peters
2621197d98 Fix lack of executable for matlab. 2017-12-27 13:26:02 +01:00
Bert Peters
0881ca5789 Fix bullet point in README. 2017-12-27 11:57:52 +01:00
Bert Peters
41d5d9d6e9 Slightly more consise reading logic. 2017-12-25 16:51:52 +01:00
Bert Peters
fb8e091a34 Implement day 25, in python 2017-12-25 10:56:51 +01:00
Bert Peters
2e95da9bdc Forgot to add input. 2017-12-24 12:45:34 +01:00
Bert Peters
9e46be0f82 Implement day 24, in java. 2017-12-24 12:27:57 +01:00
Bert Peters
93734da352 Solution to day 23, in C. 2017-12-23 11:40:44 +01:00
Bert Peters
63744509d5 Make most solutions work with make or shebang. 2017-12-22 16:56:58 +01:00
Bert Peters
2a35384c76 Solve day 22, in Julia. 
Only know programming languages left!
 2017-12-22 16:15:32 +01:00
Bert Peters
e3ee6aefe1 Apparantly, part 1 is fast enough for part 2. 2017-12-21 14:46:16 +01:00
Bert Peters
4276edc6ef Part 1 for day 21. 2017-12-21 13:55:55 +01:00
Bert Peters
eee1f48629 Slightly more consise update step. 2017-12-20 15:08:25 +01:00
Bert Peters
a9034c9208 Use correct assignment operators. 2017-12-20 14:24:35 +01:00
Bert Peters
f8cfe6dfa9 Add implementation for part 2. 2017-12-20 14:18:32 +01:00
Bert Peters
bb8c0e0658 Solution to day 20 part 1. 2017-12-20 14:01:09 +01:00
Bert Peters
9b0f2cfdb5 Even simpler bounds check. 2017-12-19 10:19:37 +01:00
Bert Peters
bbf8ad85e4 Slightly simpler bounds check. 2017-12-19 10:16:24 +01:00
Bert Peters
c1e8d32cd0 Implement day 19, in PHP. 2017-12-19 10:11:51 +01:00
Bert Peters
f28a983133 More improvements, because lua can do some things: 
- Remove manual bookkeeping of array size
- Remove duplicate 'snd' instruction
- Instructions start at 1 now, I guess
 2017-12-18 16:30:25 +01:00
Bert Peters
432fc46a2b Clean up Lua code. 
- Refactor ALU to a single function to be reused
- Abstract registers out of a global variable into a function argument
- Use proper table initialisations
- Accept that LUA starts arrays at 1. Partially.
 2017-12-18 15:18:39 +01:00
Bert Peters
80bf90c034 Slight performance improvement. 
Only need to check whether the current program is blocked, since the
other will have switched if it was going to block.
 2017-12-18 14:05:00 +01:00
Bert Peters
ffb6c52910 Missing checkmark. 2017-12-18 14:03:34 +01:00
Bert Peters
c294af6f1d Implement day 18 in Lua. 2017-12-18 13:23:56 +01:00
Bert Peters
8f59911c20 Implement day 17, in swift. 2017-12-17 17:04:41 +01:00
Bert Peters
5b1349be9d Implement day 16, in groovy. 2017-12-17 15:58:41 +01:00
Bert Peters
924c76c3b3 Implement day 15, in Haskell. 2017-12-16 23:38:17 +01:00
Bert Peters
56fb300d3b Implement day 14 in rust. 2017-12-16 22:19:05 +01:00
Bert Peters
f37b1df1c5 Implement day 13 in Go. 2017-12-13 15:06:27 +01:00
Bert Peters
4a057b138d Add solutions to day 12 in javascript. 2017-12-13 11:49:42 +01:00
Bert Peters
817ef2dcfb Handle edge case of sgn(x) != sgn(y) 2017-12-11 12:13:20 +01:00
Bert Peters
237e1014ac Oops, remove hello world. 2017-12-11 11:54:43 +01:00
Bert Peters
07cc38a493 Implement day 11 in scala. 2017-12-11 11:52:48 +01:00
Bert Peters
b368355201 Optimize bash solution for day 2. 
Now loops less (only n(n-1) / 2 times instead of n^2), doesn't call echo
spuriously, and doesn't use tail/head anymore. Results in 75% less
runtime, so I'll take it.
 2017-12-11 00:13:51 +01:00
Bert Peters
b40e549245 Forgot to mention Clojure as done 2017-12-10 17:46:42 +01:00
Bert Peters
51d1e5aed0 Implement day 10, in Kotlin 2017-12-10 17:43:43 +01:00
Bert Peters
836274331c Solution to day 9, in lex. 2017-12-10 13:06:34 +01:00
Bert Peters
65a3f8ad81 Solve (but mostly borrow) part 2. 2017-12-09 13:01:45 +01:00
Bert Peters
dbc89969a7 Add solution to day 8, in ruby. 2017-12-09 12:09:13 +01:00
Bert Peters
79adaf065c Update overview. 2017-12-07 12:55:22 +01:00