test pre-commit

Author: bqi343

solutions/bronze/cses-2431.mdx

@@ -27,7 +27,7 @@ the group. For instance:
   $\rightarrow3\cdot900=2700$ digits total
 - And so on...
 
-To find which group the number that contains the $k$-th digit is in, we can
+To find which group the number that contains the $k$th digit is in, we can
 iterate through groups until the sum of the total number of digits from all the
 groups we've processed becomes greater than or equal to $k$. In other words, we
 continue increasing the number of groups we look at (starting from $1$-digit
@@ -37,8 +37,8 @@ $$
 \sum^{\text{\# of groups}}_{n=1}{n\cdot9\cdot10^{n-1}\geq k}
 $$
 
-Once the condition becomes true, we know that the $k$-th digit must fall into
-the last group used in the sum. We can now calculate the $k$-th digit's position
+Once the condition becomes true, we know that the $k$th digit must fall into
+the last group used in the sum. We can now calculate the $k$th digit's position
 in the group by subtracting $k$ by the total number of digits from all groups
 before it. We'll call this relative position $j$:
 
@@ -48,15 +48,15 @@ $$
 
 Note that we subtract $1$ from the result in order to make $j$ $0$-based (which
 makes it more convenient to solve the rest of the problem). For example, if
-$j=0$, that would mean the $k$-th digit is the first digit in the group. If
-$j=100$, that would mean the $k$-th digit is the $99$-th digit in the group,
+$j=0$, that would mean the $k$th digit is the first digit in the group. If
+$j=100$, that would mean the $k$th digit is the $99$-th digit in the group,
 etc. From there, we can divide $j$ by $n$ (the length of the numbers in the
-group), which gives us the position of the number that contains the $k$-th digit
+group), which gives us the position of the number that contains the $k$th digit
 within the group (also $0$-based). Similarly as before, a position of $0$ means
 that the number is the first number in the group, and a position of $100$ means
 that the number is the $99$-th number in the group.
 
-To calculate the exact number the $k$-th digit is in, we can add the position of
+To calculate the exact number the $k$th digit is in, we can add the position of
 the number within the group (which we just found) to the value of the first
 number of the group, which is just $10^{n-1}$ (you can find this pattern from the
 beginning example). Now, all that's left is finding the position of the $k$-th
@@ -79,10 +79,10 @@ position that's $1$ plus a multiple of $3$, meaning its position modulo $3$
 equals $1$. Finally, the third digit in each number is always $2$ plus a
 multiple of $3$, meaning that its position modulo $3$ equals $2$. This pattern
 extends for numbers of all sizes, and it is thus why we can use the modulo
-operator to determine the $k$-th digit's $0$-based position within the number
+operator to determine the $k$th digit's $0$-based position within the number
 it's inside.
 
-Now, we can calculate our answer by converting the number that the $k$-th digit
+Now, we can calculate our answer by converting the number that the $k$th digit
 is in into a string and indexing it at the position we've just found.
 
 ## Implementation
@@ -111,7 +111,7 @@ int main() {
 	ll k;
 	cin >> q;
 
-	for (int i = 0; i < q; i++) {
+	for (int i = 0; i < q; i++)   {
 		cin >> k;
 		/*
 		 * Subtract k by sizes of groups until k becomes smaller than the size