From 08ddddacff08427fc86a07940ea02ab2fa7be6c1 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Stefan=20M=C3=BCller?= Date: Wed, 4 Dec 2024 18:09:20 +0100 Subject: [PATCH] Fix readme --- README.md | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/README.md b/README.md index 18f472c..3ae75e5 100644 --- a/README.md +++ b/README.md @@ -22,15 +22,15 @@ I'm using a `std::multiset` to collect and sort the values for both lists. This ### Day 2: Red-Nosed Reports -:mag_right: Puzzle: , :white_check_mark: Solver: [`HistorianHysteria.cpp`](AdventOfCode2024/RedNosedReports.cpp) +:mag_right: Puzzle: , :white_check_mark: Solver: [`RedNosedReports.cpp`](AdventOfCode2024/RedNosedReports.cpp) Here, we have a few conditionals to determine on the fly which of the numbers would make the report safe if dropped. The amount of cases is actually quite manageable. -### Day 3: Day 3: Mull It Over +### Day 3: Mull It Over -:mag_right: Puzzle: , :white_check_mark: Solver: [`HistorianHysteria.cpp`](AdventOfCode2024/MullItOver.cpp) +:mag_right: Puzzle: , :white_check_mark: Solver: [`MullItOver.cpp`](AdventOfCode2024/MullItOver.cpp) -A simple finite state machine crawling along the input character by character solves both parts nicely. The algorithm tracks whether `mul` instructions are enabled or not, but ignores this setting for part 1. +A simple [finite state machine](AdventOfCode2024/StringStateMachine.h) crawling along the input character by character solves both parts nicely. The algorithm tracks whether `mul` instructions are enabled or not, but ignores this setting for part 1. ## License