Skip to content

Commit 05c78cf

Browse files
committed
Formatting
1 parent 628dd31 commit 05c78cf

File tree

3 files changed

+5
-5
lines changed

3 files changed

+5
-5
lines changed

Problems/FlingLikFullOfVim.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -34,12 +34,12 @@ where the cursor is denoted by a frame like \(\boxed{i}\), then
3434

3535
Write a program that calculates the least number of key presses that Bertram needs to use to delete all the **“e”s** in the document, but no other letters. Initially, the cursor is at the first character of the document.
3636

37-
## Input
37+
## Input format
3838

3939
The first line contains the integer \( N\), the length of the document. The next line contains N characters,
4040
each one of the ten lowercase letters from **“a”** to **“j”**. The first and the last letter of the input are both different from **“e”**.
4141

42-
## Output
42+
## Output format
4343

4444
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**.
4545

Problems/MagicCircle.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -20,7 +20,7 @@ Your task is to help the Grand Mage find this minimal magic circle and determine
2020

2121
The first line contains an integer \( N \), representing the number of crystal stones.
2222

23-
The next \( N \) lines each contain two real numbers \( x_i \) and \( y_i \), representing the coordinates of the \( i \)-th crystal stone, with up to two decimal places.
23+
The next \( N \) lines each contain two real numbers \( x_i \) and \( y_i \), representing the coordinates of the \( i_{th} \) crystal stone, with up to two decimal places.
2424

2525
## Output
2626

Problems/V-Ball.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -32,15 +32,15 @@ There are, of course, many other issues to consider, but you don't need to worry
3232

3333
Your programme need to find and output the biggest \( C \) given the provided data.
3434

35-
## Input
35+
## Input format
3636

3737
The first line contains an integer \( N \).
3838

3939
The next \( N \) lines contain \( N \) integers each, where the integer at the \( i_{th} \) row and \( j_{th} \) column is represented as \( a_{i,j} \).
4040

4141
The following \( N \) lines contain \( N \) integers each, where the integer at the \( i_{th} \) row and \( j_{th} \) column is represented as \( b_{i,j} \).
4242

43-
## Output
43+
## Output format
4444

4545
Output a single number, representing the maximum value of \( C \). The answer should be rounded to **6 decimal places**, and the contestant’s output must exactly match the standard output.
4646

0 commit comments

Comments
 (0)