Update remark

fwcd · Jan 31, 2024 · c0bcdcc · c0bcdcc
1 parent dabfe83
commit c0bcdcc
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/README.md b/README.md
@@ -53,7 +53,7 @@ Every day is packaged up to take exactly one command-line argument, the input fi
 - Visualize the input with GraphViz (day 8, 20, 23)
 - Some puzzles are actually reverse-engineering exercises and rely on undocumented input constraints to be solved efficiently or even feasibly at all (day 8, 20, 23)
 - Take the [LCM](https://en.wikipedia.org/wiki/Least_common_multiple) to solve cycle alignment problems (day 8, 20)
- - More complex problems would likely require 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)
+ - 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)
 
 ## Previous years

diff --git a/README.md.gyb b/README.md.gyb
@@ -53,7 +53,7 @@ Every day is packaged up to take exactly one command-line argument, the input fi
 - Visualize the input with GraphViz (day 8, 20, 23)
 - Some puzzles are actually reverse-engineering exercises and rely on undocumented input constraints to be solved efficiently or even feasibly at all (day 8, 20, 23)
 - Take the [LCM](https://en.wikipedia.org/wiki/Least_common_multiple) to solve cycle alignment problems (day 8, 20)
- - More complex problems would likely require 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)
+ - 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)
 
 ## Previous years