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 |
 | ---------- | -------- | ----- | -------- |
-| 1700 | [CF769C](https://codeforces.com/problemset/problem/769/C) | For the first few steps, you can use greedy approach, but you should guarantee that you can come back. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2025/01/0101/solution/cf769c.md) |
-| 2000 | [CF2045B](https://codeforces.com/problemset/problem/2045/B) | $D$ can step in only once. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2025/01/0101/solution/cf2045b.md) |
+| 1700 | [CF581D](https://codeforces.com/problemset/problem/581/D) | There are only a few configurations. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2025/01/0102/solution/cf581d.md) |
+| 2000 | [CF33D](https://codeforces.com/problemset/problem/33/D) | Circles without intersections can be represented as a tree. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2025/01/0102/solution/cf33d.md) |

categories/brute_force.md

@@ -12,6 +12,7 @@
 | 1700 | [CF818D](https://codeforces.com/problemset/problem/818/D) | How can you check if $x$ satisfy the condition? What's the time complexity? How can you reduce the sum of time complexity? | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/10/1023/solution/cf818d.md) |
 | 1700 | [CF1142A](https://codeforces.com/problemset/problem/1142/A) | Consider the different distance between the $2$ spots. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/12/1212/solution/cf1142a.md) |
 | 1700 | [CF479D](https://codeforces.com/problemset/problem/479/D) | You don't need to make a lot of marks. What are the different cases? | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/12/1218/solution/cf479d.md) |
+| 1700 | [CF581D](https://codeforces.com/problemset/problem/581/D) | There are only a few configurations. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2025/01/0102/solution/cf581d.md) |
 | 1800 | [CF1267J](https://codeforces.com/problemset/problem/1267/J) | We only cares about the frequency of each number. And the answer will not exceed the minimum of it. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/04/0429/solution/cf1267j.md) |
 | 1800 | [CF551B](https://codeforces.com/problemset/problem/551/B) | Enumerate the number of $b$ -s. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/09/0909/solution/cf551b.md) |
 | 1800 | [CF641C](https://codeforces.com/problemset/problem/641/C) | Odd-s and even-s move together. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/09/0916/solution/cf641c.md) |

categories/geometry.md

@@ -11,5 +11,6 @@
 | 1900 | [CF1032D](https://codeforces.com/problemset/problem/1032/D) | If you want to get to the line, you should go straight to it. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/06/0625/solution/cf1032d.md) |
 | 1900 | [CF613A](https://codeforces.com/problemset/problem/613/A) | You just need to find the minimum and the maximum distance. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/10/1029/solution/cf613a.md) |
 | 2000 | [CF248C](https://codeforces.com/problemset/problem/248/C) | The wall is like a mirror, so kick the ball towards the target "in the mirror". To get the ball in, it's always good to kick it towards farther side of the gate. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/08/0829/solution/cf248c.md) |
+| 2000 | [CF33D](https://codeforces.com/problemset/problem/33/D) | Circles without intersections can be represented as a tree. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2025/01/0102/solution/cf33d.md) |
 | 2100 | [CF166B](https://codeforces.com/problemset/problem/166/B) | How to decide a point is inside a convex hull? What about many points? | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/03/0313/solution/cf166b.md) |
 | 2300 | [CF306D](https://codeforces.com/problemset/problem/306/D) | When you decide the first few edges, the last ones are already settled. How can you make it different? | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/12/1228/solution/cf306d.md) |

categories/trees.md

@@ -25,6 +25,7 @@
 | 2000 | [CF1280C](https://codeforces.com/problemset/problem/1280/C) | Consider each edge. What's its maximum / minimum times to be calculated? Is it achievable? | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/11/1106/solution/cf1280c.md) |
 | 2000 | [CF814D](https://codeforces.com/problemset/problem/814/D) | How can you check the relation between circles? Then, make the most use of the second group. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/11/1107/solution/cf814d.md) |
 | 2000 | [CF533B](https://codeforces.com/problemset/problem/533/B) | Classic tree DP. Don't forget the conditions you should satisfy to add one employee. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/11/1121/solution/cf533c.md) |
+| 2000 | [CF33D](https://codeforces.com/problemset/problem/33/D) | Circles without intersections can be represented as a tree. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2025/01/0102/solution/cf33d.md) |
 | 2100 | [CF1152D](https://codeforces.com/problemset/problem/1152/D) | Try solving the problem in a smaller tree. What information should be necessary for your DP function? | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/02/0228/solution/cf1152d.md) |
 | 2100 | [CF576B](https://codeforces.com/problemset/problem/576/B) | Construct a graph using the permutation. For the final tree, construct an edge first, what edges should it produce? Summarize and find the necessary conditions. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/03/0311/solution/cf576b.md) |
 | 2100 | [CF802K](https://codeforces.com/problemset/problem/802/K) | When considering a subtree, there are two possible situations: you return to the root to get to the other subtrees; you never return. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/06/0601/solution/cf802k.md) |