Commit Graph

266 Commits

Author SHA1 Message Date
8fef472a58 Clarify bitmagic.
[skip ci]
2018-12-05 22:45:55 +01:00
f3d0297da5 Bithack optimizations, why not.
It saves a branch and a (possibly inlined) function call, but it also
halves the runtime.
2018-12-05 22:37:22 +01:00
f426e7067a More easily time the program. 2018-12-05 12:23:54 +01:00
f4cbb75e63 Attempt 3 to fix travis ignore. 2018-12-05 10:56:34 +01:00
a2f0026c18 Fix ignore of ubuntu rust. 2018-12-05 10:53:26 +01:00
aeb2faa6c9 Also test for Ubuntu's rust version. 2018-12-05 10:51:15 +01:00
28d38470a6 Move sample input to separate files. 2018-12-05 10:43:58 +01:00
3543351c20 Implement day 05.
This was a nice exercise in not allocating memory. Or at least it was,
for part 1.
2018-12-05 10:39:39 +01:00
3d68f20097 Slightly more efficient and compact code.
This version loops the input twice, first to build the claims, and then
to check whether they have been claimed more than once.
2018-12-05 09:53:42 +01:00
38db4487e3 Add missing input for day 3. 2018-12-04 15:16:50 +01:00
43eeacc686 Rework previous regex use. 2018-12-04 13:49:16 +01:00
1e51012d5e Implement day 4.
Nice code-reuse between 1 and 2. I'm not accustomed to this.
2018-12-04 13:41:45 +01:00
9a0f24d6bb Implement day 3.
Wasted way too much trying to do this cleverly.
2018-12-03 10:41:38 +01:00
fd5af9245b Implement day 2.
Part two was weird.
2018-12-02 10:36:45 +01:00
e4e4432810 Add travis button. 2018-12-01 13:37:33 +01:00
3bbe6a479a Implement day 1 2018.
We've started.
2018-12-01 11:03:48 +01:00
c41099d9d5 Implement day 11.
Whelp, this was really annoying.
2018-11-30 16:39:42 +01:00
48db1dde39 Simplify the "find" operation. 2018-11-30 14:13:58 +01:00
2ec8dddb66 Reimplement day 21. 2018-11-30 13:59:53 +01:00
b570821c8a Properly use the never type. 2018-11-29 17:01:01 +01:00
d02fd49bd6 Clean up tests 2018-11-29 16:58:51 +01:00
fccb7d28ad Fix some warnings. 2018-11-29 16:56:52 +01:00
57b2981a15 Reimplement day 2. 2018-11-29 16:55:51 +01:00
80328015d2 Implement day 25. 2018-11-29 16:31:57 +01:00
a104356b6f Slightly nicer day parsing. 2018-11-22 16:39:53 +01:00
8d1baf1e8d CI building for more rust versions. 2018-11-22 16:26:17 +01:00
37f9e696bc Implement day 24. 2018-11-22 15:59:51 +01:00
b35d785d69 Implement day 23.
Could use some optimization, but it works.
2018-11-14 12:50:53 +01:00
0132627341 Move Assembunny CPU to common. 2018-11-14 12:09:03 +01:00
1d6edda98b Actually commit the implementation. 2018-11-13 11:54:56 +01:00
be8be856ac Implement day 16. 2018-11-13 11:51:43 +01:00
8910dbe072 Generify gcd/lcm. 2018-11-12 15:52:21 +01:00
6ad8f4cb56 Implement day 15 of 2016. 2018-11-12 15:22:37 +01:00
42d075f8f4 Update 2018 skeleton. 2018-11-12 13:18:16 +01:00
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
71eb13f52d Set up for AoC 2018. 2018-11-09 16:11:08 +01:00
7e9dff9be6 Add a script to time all days. 2018-01-27 22:25:25 +01:00
fc2c0e245d Makefile for automated running of swift. 2018-01-27 22:24:49 +01:00
a751456596 Fix Haskell compilation on Arch Linux. 2017-12-27 19:10:40 +01:00
2939822329 Add missing input for day 14. 2017-12-27 13:45:27 +01:00
2621197d98 Fix lack of executable for matlab. 2017-12-27 13:26:02 +01:00
0881ca5789 Fix bullet point in README. 2017-12-27 11:57:52 +01:00
41d5d9d6e9 Slightly more consise reading logic. 2017-12-25 16:51:52 +01:00
fb8e091a34 Implement day 25, in python 2017-12-25 10:56:51 +01:00
2e95da9bdc Forgot to add input. 2017-12-24 12:45:34 +01:00
9e46be0f82 Implement day 24, in java. 2017-12-24 12:27:57 +01:00
93734da352 Solution to day 23, in C. 2017-12-23 11:40:44 +01:00
63744509d5 Make most solutions work with make or shebang. 2017-12-22 16:56:58 +01:00
2a35384c76 Solve day 22, in Julia.
Only know programming languages left!
2017-12-22 16:15:32 +01:00
e3ee6aefe1 Apparantly, part 1 is fast enough for part 2. 2017-12-21 14:46:16 +01:00