Add another lesson learned

fwcd · Feb 8, 2024 · 5f79212 · 5f79212
1 parent 1fc2183
commit 5f79212
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 0 deletions.
diff --git a/README.md b/README.md
@@ -55,6 +55,7 @@ Every day is packaged up to take exactly one command-line argument, the input fi
 - Take the [LCM](https://en.wikipedia.org/wiki/Least_common_multiple) to solve cycle alignment problems (day [8](day08), [20](day20))
  - If there are offsets, use the [CRT](https://en.wikipedia.org/wiki/Chinese_remainder_theorem) ([like in previous years](https://github.com/fwcd/advent-of-code-2020/blob/18c3ba9820cb52627366a632ccaab233a6d9f563/day13/src/day13.c#L39-L59))
 - Binary counters can elegantly be modeled as chains of flip flop (day [20](day20))
+- Cross products can be surprisingly useful to turn the most nonlinear-looking problems into linear equations (day [24](day24))
 
 ## Previous Years
 

diff --git a/README.md.gyb b/README.md.gyb
@@ -58,6 +58,7 @@ Every day is packaged up to take exactly one command-line argument, the input fi
 - Take the [LCM](https://en.wikipedia.org/wiki/Least_common_multiple) to solve cycle alignment problems (${day_links([8, 20])})
  - If there are offsets, use the [CRT](https://en.wikipedia.org/wiki/Chinese_remainder_theorem) ([like in previous years](https://github.com/fwcd/advent-of-code-2020/blob/18c3ba9820cb52627366a632ccaab233a6d9f563/day13/src/day13.c#L39-L59))
 - Binary counters can elegantly be modeled as chains of flip flop (${day_links([20])})
+- Cross products can be surprisingly useful to turn the most nonlinear-looking problems into linear equations (${day_links([24])})
 
 ## Previous Years