Add links to editorials

README.md

@@ -24,5 +24,5 @@ Here are the current statistics of submissions: [Link](https://yawn-sean.github.
 
 | Difficulty | Problems | Hints | Solution |
 | ---------- | -------- | ----- | -------- |
-| 1600 | [CF980B](https://codeforces.com/problemset/problem/980/B) | You don't need to actually calculate the number of shortest paths. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/12/1221/solution/cf980b.md) |
-| 2200 | [CF507D](https://codeforces.com/problemset/problem/507/D) | The modulo condition starts from the suffix, so DP from the right. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/12/1221/solution/cf507d.md) |
+| 1800 | [CF77B](https://codeforces.com/problemset/problem/77/B) | Try drawing the area that satisfies the conditions. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/12/1223/solution/cf77b.md) |
+| 1900 | [CF134B](https://codeforces.com/problemset/problem/134/B) | If the final pair is fixed, the number of steps is fixed. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/12/1223/solution/cf134b.md) |

categories/number_theory.md

@@ -34,6 +34,7 @@
 | 1900 | [CF1055C](https://codeforces.com/problemset/problem/1055/C) | As the length of the intervals are fixed, we just need to let their ends to be as close as possible. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/09/0902/solution/cf1055c.md) |
 | 1900 | [CF731F](https://codeforces.com/problemset/problem/731/F) | Derive the final formula to calculate first. The $a_i$ can't be large. How can that help? | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/09/0924/solution/cf731f.md) |
 | 1900 | [CF356B](https://codeforces.com/problemset/problem/356/B) | Which pairs of positions can meet? | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/12/1209/solution/cf356b.md) |
+| 1900 | [CF134B](https://codeforces.com/problemset/problem/134/B) | If the final pair is fixed, the number of steps is fixed. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/12/1223/solution/cf134b.md) |
 | 2000 | [CF621E](https://codeforces.com/problemset/problem/621/E) | How does the status change after using each block? How to process them quickly? | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/03/0306/solution/cf621e.md) |
 | 2000 | [CF258C](https://codeforces.com/problemset/problem/258/C) | Sequence questions: here, order doesn't matter, so we can find the most important element. What is that? How can it help? | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/02/0229/solution/cf258c.md) |
 | 2000 | [CF1903E](https://codeforces.com/problemset/problem/1903/E) | We only care about the parity of the result. So the sum of the square of the Euclidean distance can be simplified. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/04/0411/solution/cf1903e.md) |

categories/probabilities.md

@@ -6,6 +6,7 @@
 | *1700 | [CF398B](https://codeforces.com/problemset/problem/398/B) | You just care about how many rows and columns remain after operations. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/11/1128/solution/cf398b.md) |
 | 1800 | [CF442B](https://codeforces.com/problemset/problem/442/B) | Calculate the marginal effect of adding one person. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/07/0716/solution/cf442b.md) |
 | 1800 | [CF626D](https://codeforces.com/problemset/problem/626/D) | Consider the first $2$ balls as a whole. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/07/0730/solution/cf626d.md) |
+| 1800 | [CF77B](https://codeforces.com/problemset/problem/77/B) | Try drawing the area that satisfies the conditions. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/12/1223/solution/cf77b.md) |
 | 1900 | [CF935D](https://codeforces.com/problemset/problem/935/D) | Again, if a string is smaller than the other, we should let their prefix be the same and the next letter be smaller. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/09/0930/solution/cf935d.md) |
 | 2000 | [CF1009E](https://codeforces.com/problemset/problem/1009/E) | Consider the contribution of each $a_i$ . | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/06/0626/solution/cf1009e.md) |
 | 2000 | [CF309A](https://codeforces.com/problemset/problem/309/A) | Additivity of expectation. How can a bumping occur? | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/09/0919/solution/cf309a.md) |