diff --git a/README.md b/README.md
index a3e1adca3c..c7d0f7a347 100644
--- a/README.md
+++ b/README.md
@@ -24,5 +24,5 @@ Here are the current statistics of submissions: [Link](https://yawn-sean.github.
 
 | Difficulty | Problems | Hints | Solution |
 | ---------- | -------- | ----- | -------- |
-| 1600 | [CF353C](https://codeforces.com/problemset/problem/353/C) | If the chosen value is already smaller, all of the lower digits should be collected. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/11/1116/solution/cf430a.md) |
-| 2200 | [CF163C](https://codeforces.com/problemset/problem/163/C) | Each round of run is about choosing an interval in the conveyor. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/11/1116/solution/cf932d.md) |
\ No newline at end of file
+| 1600 | [CF430A](https://codeforces.com/problemset/problem/430/A) | "Differ by at most one". Note that the points chosen by an interval are consecutive. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/11/1116/solution/cf430a.md) |
+| 2200 | [CF932D](https://codeforces.com/problemset/problem/932/D) | How can you find the first larger predecessor quickly? Jump through the useless predecessors. Then connect the vertice with its predecessor, and you just need to calculate most steps that could be taken. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/11/1116/solution/cf932d.md) |
\ No newline at end of file
diff --git a/categories/constructive.md b/categories/constructive.md
index 846b968138..428ef36157 100644
--- a/categories/constructive.md
+++ b/categories/constructive.md
@@ -9,7 +9,7 @@
 | 1600 | [CF1059C](https://codeforces.com/problemset/problem/1059/C) | Get the first non- $1$ element as soon as possible. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/07/0713/solution/cf1059c.md) |
 | 1600 | [CF1243B2](https://codeforces.com/problemset/problem/1243/B2) | You only need to use $2$ operations to get one position right. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/07/0719/solution/cf1243b2.md) |
 | 1600 | [CF878A](https://codeforces.com/problemset/problem/878/A) | Consider each bit separately. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/08/0823/solution/cf878a.md) |
-| 1600 | [CF353C](https://codeforces.com/problemset/problem/353/C) | If the chosen value is already smaller, all of the lower digits should be collected. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/11/1116/solution/cf430a.md) |
+| 1600 | [CF430A](https://codeforces.com/problemset/problem/430/A) | "Differ by at most one". Note that the points chosen by an interval are consecutive. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/11/1116/solution/cf430a.md) |
 | 1700 | [CF765D](https://codeforces.com/problemset/problem/765/D) | The problem is about a graph. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/04/0424/solution/cf765d.md) |
 | 1700 | [CF954C](https://codeforces.com/problemset/problem/954/C) | What can be the difference between two neighboring positions? | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/05/0515/solution/cf954c.md) |
 | 1700 | [CF960C](https://codeforces.com/problemset/problem/960/C) | How can you produce an array such that each subsequence of it satisfy the conditions? Base your solution on this. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/05/0516/solution/cf960c.md) |
diff --git a/categories/data_structures.md b/categories/data_structures.md
index 3ff9310488..124278e1e7 100644
--- a/categories/data_structures.md
+++ b/categories/data_structures.md
@@ -88,5 +88,5 @@
 | 2200 | [CF1039C](https://codeforces.com/problemset/problem/1039/C) | For each $x$, find the number of corresponding methods. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/08/0817/solution/cf1039c.md) |
 | 2200 | [CF431E](https://codeforces.com/problemset/problem/431/E) | You should fill up the containers with the minimum number of mercury first. How much volume can you put in them without exceeding the other containers? How can you calculate it efficiently? | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/08/0824/solution/cf431e.md) |
 | 2200 | [CF413E](https://codeforces.com/problemset/problem/413/E) | Classic segment tree problem. It's just what variable should you choose. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/09/0921/solution/cf413e.md) |
-| 2200 | [CF163C](https://codeforces.com/problemset/problem/163/C) | Each round of run is about choosing an interval in the conveyor. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/11/1116/solution/cf932d.md) |
+| 2200 | [CF932D](https://codeforces.com/problemset/problem/932/D) | How can you find the first larger predecessor quickly? Jump through the useless predecessors. Then connect the vertice with its predecessor, and you just need to calculate most steps that could be taken. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/11/1116/solution/cf932d.md) |
 | 2300 | [CF558D](https://codeforces.com/problemset/problem/558/D) | Each condition represents $1/2$ segments in the leaves. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/10/1005/solution/cf558d.md) |
\ No newline at end of file
diff --git a/categories/trees.md b/categories/trees.md
index 9ec0b4fba2..387d378d87 100644
--- a/categories/trees.md
+++ b/categories/trees.md
@@ -28,4 +28,4 @@
 | 2100 | [CF231E](https://codeforces.com/problemset/problem/231/E) | Where can you find a different way between the nodes? Count that in a tree. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/07/0726/solution/cf231e.md) |
 | 2100 | [CF838B](https://codeforces.com/problemset/problem/838/B) | How can you go from $u$ to $v$ ? What is the distance dependent on? | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/09/0906/solution/cf838b.md) |
 | 2200 | [CF1615D](https://codeforces.com/problemset/problem/1615/D) | How can you calculate the xor-sum of a path on the tree? Then, what kind of information does the conditions offer you? | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/04/0420/solution/cf1615d.md) |
-| 2200 | [CF163C](https://codeforces.com/problemset/problem/163/C) | Each round of run is about choosing an interval in the conveyor. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/11/1116/solution/cf932d.md) |
\ No newline at end of file
+| 2200 | [CF932D](https://codeforces.com/problemset/problem/932/D) | How can you find the first larger predecessor quickly? Jump through the useless predecessors. Then connect the vertice with its predecessor, and you just need to calculate most steps that could be taken. | [Editorial](https://github.com/Yawn-Sean/Daily_CF_Problems/blob/main/daily_problems/2024/11/1116/solution/cf932d.md) |