Bert Peters bert
bert synced commits to master at bert/adventofcode from mirror 2021-12-11 23:27:22 +01:00
84c160cf54 Simplify part 2
bert synced commits to master at bert/adventofcode from mirror 2021-12-11 15:27:22 +01:00
440d454911 Implement day 11
bert synced commits to master at bert/adventofcode from mirror 2021-12-10 15:27:22 +01:00
50cd6d8171 Implementation day 10 2021
bert synced commits to master at bert/adventofcode from mirror 2021-12-09 15:27:22 +01:00
dde9c0adbf Update to RC version of clap
e0e1bc26e8 Simplify implementation day 8
77ce31980b Implement day 9
Compare 3 commits »
bert synced commits to master at bert/adventofcode from mirror 2021-12-08 15:17:23 +01:00
8c78106846 Bit-optimize day 8
22f767e8df Implement day 08 2021
Compare 2 commits »
bert synced commits to master at bert/adventofcode from mirror 2021-12-07 15:17:22 +01:00
3434966ac2 Just use the median, obviously
c5f66fcc09 Avoid more allocations in day 7 part 1
c02f1e11c5 Convert recursion to iteration
d099614217 Improve part 2 with binary search
766ee91719 Brute-force day 7 part 2
Compare 6 commits »
bert synced commits to master at bert/adventofcode from mirror 2021-12-06 15:17:22 +01:00
b369f9d36a Implement day 6 2021
bert synced commits to master at bert/adventofcode from mirror 2021-12-05 15:17:22 +01:00
1433b0cdbe Implement day 5
bert synced commits to master at bert/adventofcode from mirror 2021-12-04 15:10:26 +01:00
5e52da6e6b Use iterator instead of range
e50b812aed Day 4: more efficiently ignore completed cards
fdef10a78e Less awkward line length hack
392aefb32d Less allocations in day 3 part 2
fb358be8f0 Implementation day 4 2021
Compare 5 commits »
bert synced commits to master at bert/adventofcode from mirror 2021-12-03 15:10:26 +01:00
612d3ecb6b Tricky solution day 03, could possibly be improved
bert synced commits to master at bert/adventofcode from mirror 2021-12-02 23:10:26 +01:00
d08a4e0e4e Merge day 1 solutions
ed844a997c Create reusable line reader
Compare 2 commits »
bert synced commits to master at bert/adventofcode from mirror 2021-12-02 15:10:26 +01:00
1c4c8f6699 Create reusable line reader
c9468ba139 Implementation 2021 day 2
Compare 2 commits »
bert synced commits to master at bert/aur from mirror 2021-12-02 04:00:26 +01:00
b07d340aab upgpkg: ttf-lastresort 14.000-1
0e0c87aa2f Add 'ttf-lastresort/' from commit '56107471e4cd77286bcaab3131673f0744f331d7'
56107471e4 Update to v13.001
d997312537 Update package for new source
8c7fb7ebd7 Dump unzip dependency.
Compare 6 commits »
bert synced commits to master at bert/adventofcode from mirror 2021-12-01 23:10:24 +01:00
938eda0d22 Rework day 1
bert synced and deleted reference prepare/2021 at bert/adventofcode from mirror 2021-12-01 15:10:24 +01:00
bert synced commits to master at bert/adventofcode from mirror 2021-12-01 15:10:24 +01:00
f413b08da6 Very quick implementation for day 1
10531e3422 Merge pull request #3 from bertptrs/prepare/2021
2e0a7ea81d Update READMEs for 2021.
2c64028978 Enable debug information for release
89159137fe Add other days
Compare 8 commits »
bert synced commits to prepare/2021 at bert/adventofcode from mirror 2021-11-29 23:10:24 +01:00
2e0a7ea81d Update READMEs for 2021.
bert synced commits to prepare/2021 at bert/adventofcode from mirror 2021-11-28 23:10:24 +01:00
2c64028978 Enable debug information for release
89159137fe Add other days
186d91d1b7 Use function pointers over dyn traits
Compare 3 commits »
bert synced commits to prepare/2021 at bert/adventofcode from mirror 2021-11-22 23:10:24 +01:00
c985ba8a1a Add CI for 2021
bert synced commits to prepare/2021 at bert/adventofcode from mirror 2021-11-22 15:10:24 +01:00
93660e28b3 Add CI for 2021