Formatting

- Some Markdown formatting applied

- FlingLikFullOfVim edited

Author: hnrobert

Problems/Ballons.md

@@ -20,6 +20,7 @@ The sequence of inflation is precise—each balloon inflates in the order it was
 The Balloon Masters are tasked with determining the final radius of each balloon after inflation completes. This isn't just a test of knowledge; it determines the harmony and beauty of the festival display. Will you, a rising apprentice Balloon Master, be able to predict the mesmerizing finale of the festival's radiant balloons?
 
 ## Task
+
 There are n balloons, all of which are empty at the beginning.
 
 Next, they are inflated in order from $1$ to $n$, with the $i$-th balloon touching the ground at position $x_i$.
@@ -29,27 +30,34 @@ When a balloon touches a balloon in front of it or reaches the maximum radius li
 Now please find out the final radius of each balloon.
 
 ## Input format
+
 The first line of input will include an interger $n$, the number of ballons.
 
 Then follows $n$ lines. Each line contains $2$ **intergers** $x_i$ and $r_i$.
 
 ## Output format
+
 Your output should include exact $n$ lines. The $i$-th line contains an demical number accurate to **3** demical places representing the minimum length of circle for $i$-th b.
 
 ## Sample input and output
+
 ### Input #1
-```
+
+```in
 3
 0 9
 8 1
 13 7
 ```
+
 ### Output #1
-```
+
+```out
 9.000
 1.000
 4.694
 ```
 
 ## Data size
-For 100\% of the test data: $1 \le n \le 2\times 10^{5}$ and $0\le x_i,r_i \le 1\times 10^{9}$.
+
+For 100\% of the test data: $1 \le n \le 2\times 10^{5}$ and $0\le x_i,r_i \le 1\times 10^{9}$.

Problems/FlingLikFullOfVim.md

@@ -43,20 +43,20 @@ each one of the ten lowercase letters from **“a”** to **“j”**. The first
 
 ### Output
 
-The only line of output should contain exactly one integer: the least number of key presses Bertram needs to delete all the **“e”s**.
+The only line of output should contain exactly one integer \( T \): the least number of key presses Bertram needs to delete all the **“e”s**.
 
 ### Example
 
 #### Example Input #1
 
-```text
+```in
 35
 chefeddiefedjeffeachbigagedegghehad
 ```
 
 #### Example Output #1
 
-```text
+```out
 36
 ```
 
@@ -75,3 +75,13 @@ You can test this by starting the Vim editor yourself (type **“vim 1.txt”**
 - For 50% of the test cases, \( N \le 500 \).
 - For 60% of the test cases, \( N \le 5000 \).
 - For 100% of the test cases, \( N \le 70000 \).
+
+### For ya
+
+In actual cases where \( T \ge 14 \), this is more likely to be efficient (not counting the \<Shift\> key):
+
+```text
+:%s/\%d101//g<Enter>
+```
+
+Ah, but alas, poor Bertram was unaware of this clever workaround, that's a pity. But let’s remain optimistic — perhaps soon he’ll stumble upon these knowledge and become a true Vim master!

Problems/MagicCircle.md

@@ -37,7 +37,7 @@ Your answer is considered correct if all the outputs' absolute error does not ex
 
 #### Example Input #1
 
-```text
+```in
 6
 8.0 9.0
 4.0 7.5
@@ -49,7 +49,7 @@ Your answer is considered correct if all the outputs' absolute error does not ex
 
 #### Example Output #1
 
-```text
+```out
 5.0000000000
 5.0000000000 5.0000000000
 ```

Problems/Patrol.md

@@ -29,16 +29,20 @@ As the kingdom’s most talented strategist, you are tasked with determining whi
 **Note that in this problem, $k=1$.**
 
 ## Input format
+
 The first line of input will include $2$ intergers $n$ and $k$, the number of villages and number of road(s) to be built.
 
 Then follows $n$ lines. Each line contains $2$ intergers $x$ and $y$, meaning that there exists a path between village $x$ and village $y$.
 
 ## Output format
+
 One interger representing the minimum length of patrol route.
 
 ## Sample input and output
+
 ### Input #1
-```
+
+```in
 8 1 
 1 2 
 3 1 
@@ -48,10 +52,13 @@ One interger representing the minimum length of patrol route.
 8 5 
 5 6 
 ```
+
 ### Output #1
-```
+
+```out
 11
 ```
 
 ## Data size
-For 100\% of the test data: $1 \le n \le 10^{5}$ and $k=1$.
+
+For 100\% of the test data: $1 \le n \le 10^{5}$ and $k=1$.

Problems/PatrolPro.md

@@ -29,16 +29,20 @@ As the kingdom’s most talented strategist, you are tasked with determining whi
 **Note that in this problem, $1\le k \le 2$.**
 
 ## Input format
+
 The first line of input will include $2$ intergers $n$ and $k$, the number of villages and number of road(s) to be built.
 
 Then follows $n$ lines. Each line contains $2$ intergers $x$ and $y$, meaning that there exists a path between village $x$ and village $y$.
 
 ## Output format
+
 One interger representing the minimum length of patrol route.
 
 ## Sample input and output
+
 ### Input #1
-```
+
+```in
 8 1 
 1 2 
 3 1 
@@ -48,12 +52,16 @@ One interger representing the minimum length of patrol route.
 8 5 
 5 6 
 ```
+
 ### Output #1
-```
+
+```out
 11
 ```
+
 ### Input #2
-```
+
+```in
 8 2 
 1 2 
 3 1 
@@ -63,22 +71,29 @@ One interger representing the minimum length of patrol route.
 8 5 
 5 6 
 ```
+
 ### Output #2
-```
+
+```out
 10
 ```
+
 ### Input #3
-```
+
+```in
 5 2 
 1 2 
 2 3 
 3 4 
 4 5 
 ```
+
 ### Output #3
-```
+
+```out
 6
 ```
 
 ## Data size
-For 100\% of the test data: $1 \le n \le 10^{5}$ and $1\le k\le 2$.
+
+For 100\% of the test data: $1 \le n \le 10^{5}$ and $1\le k\le 2$.

Problems/Scroll.md

@@ -19,11 +19,13 @@ However, time is of the essence. With competing kingdoms attempting to decode th
 Will you rise to the challenge and help the Council of Decoders unravel the secrets of The Eternal Sequence? The fate of knowledge itself hangs in the balance.
 
 ## Task
+
 For a given string of length $n$, you are asked to handle $m$ queries about the minimum length of recurrence segment in the interval $[l,r]$.
 
 **Hint** Recurrence segment of a string refers to a specific substring that repeats within the given string. For example, `abc` is a recurrence segment of `abcabcabc` while `abcabc` isn't.
 
 ## Input format
+
 The first line of input will include an interger $n$, the length of given string.
 
 The second line will be the string contains only lowercase letters.
@@ -33,11 +35,14 @@ The third line will include an interger $m$, the number of queries.
 Then follows $m$ lines. Each line contains $2$ intergers $l$ and $r$.
 
 ## Output format
+
 Your output should include exact $m$ lines. The $i$-th line contains an interger representing the minimum length of circle for $i$-th query.
 
 ## Sample input and output
+
 ### Input #1
-```
+
+```in
 10
 abcabcddee
 5
@@ -47,8 +52,10 @@ abcabcddee
 1 1
 4 6
 ```
+
 ### Output #1
-```
+
+```out
 3
 3
 2
@@ -57,6 +64,7 @@ abcabcddee
 ```
 
 ## Data size
+
 For 100\% of the test data: $1 \le n \le 5\times 10^{5}$ and $1\le m \le 1\times 10^{6}$.
 
-The given string is constructed by LOWERCASE letters only.
+The given string is constructed by LOWERCASE letters only.

Problems/V-Ball.md

@@ -50,7 +50,7 @@ Output a single number, representing the maximum value of \( C \). The answer sh
 
 #### Example Input #1
 
-```text
+```in
 3
 19 17 16
 25 24 23
@@ -62,7 +62,7 @@ Output a single number, representing the maximum value of \( C \). The answer sh
 
 #### Example Output #1
 
-```text
+```out
 5.357143
 ```