Commit Graph

116 Commits

Author SHA1 Message Date
bert f77e5adf2a Implement day 6. 2018-12-06 13:08:28 +01:00
bert bdea21d92b Day 06 inputs. 2018-12-06 11:10:51 +01:00
bert 8fef472a58 Clarify bitmagic.
[skip ci]
2018-12-05 22:45:55 +01:00
bert 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
bert f426e7067a More easily time the program. 2018-12-05 12:23:54 +01:00
bert 28d38470a6 Move sample input to separate files. 2018-12-05 10:43:58 +01:00
bert 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
bert 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
bert 38db4487e3 Add missing input for day 3. 2018-12-04 15:16:50 +01:00
bert 43eeacc686 Rework previous regex use. 2018-12-04 13:49:16 +01:00
bert 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
bert 9a0f24d6bb Implement day 3.
Wasted way too much trying to do this cleverly.
2018-12-03 10:41:38 +01:00
bert fd5af9245b Implement day 2.
Part two was weird.
2018-12-02 10:36:45 +01:00
bert 3bbe6a479a Implement day 1 2018.
We've started.
2018-12-01 11:03:48 +01:00
bert 42d075f8f4 Update 2018 skeleton. 2018-11-12 13:18:16 +01:00
bert 71eb13f52d Set up for AoC 2018. 2018-11-09 16:11:08 +01:00