[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

solutions/gold/cf-100886G.mdx

@@ -10,7 +10,7 @@ If $l = 1$, what will the best solution always be?
 </Spoiler>
 ## Explanation
 ### $l = 1$
-Let's start with an example: $l = 1$ and $r = 875$. Observe that we really need to consider three numbers as viable answers: $875$, $799$, and $869$. Try to think about why, and how this generalizes! 
+Let's start with an example: $l = 1$ and $r = 875$. Observe that we really need to consider three numbers as viable answers: $875$, $799$, and $869$. Try to think about why, and how this generalizes!
 ### $l \neq 1$
 We can apply a very similar approach when $l \neq 1$. In fact, it's almost identical, with one minor difference. Consider the case where $l = 855$ and $r = 875$, just as before. The only difference is we can no longer consider $799$ as a viable answer, as it is less than $l$. Again, try to think about how to generalize this!
 
@@ -43,15 +43,15 @@ int main() {
 	while (l.length() < r.length()) { l.insert(l.begin(), '0'); }
 	string ans = "";
 	// i -> length of LCP (longest common prefix) of str and r
-	bool eq = true; // whether l[0, i) = r[0, i)
+	bool eq = true;  // whether l[0, i) = r[0, i)
 	for (int i = 0; i <= r.length(); i++) {
 		string cur = r.substr(0, i);
 		eq = eq && l[i] == r[i];
 		/*
-		* in this case, str[i] must equal r[i]
-		* and now the shared prefix has length i + 1
-		* which contradicts our assumption that the LCP has length i
-		*/
+		 * in this case, str[i] must equal r[i]
+		 * and now the shared prefix has length i + 1
+		 * which contradicts our assumption that the LCP has length i
+		 */
 		if (i < r.length() && eq) { continue; }
 		if (i < r.length()) { cur += char(r[i] - 1); }
 		// fill remaining digits with 9's
@@ -62,7 +62,6 @@ int main() {
 	while (ans[0] == '0') { ans.erase(ans.begin()); }
 	cout << ans << endl;
 }
-
 ```
 
 </CPPSection>