Formatting & Unifying

Author: hnrobert

.gitignore

@@ -3,3 +3,5 @@
 
 # Ignore Windows .ini files
 *.ini
+
+.vscode

Answers/MagicCircle.cpp

@@ -7,14 +7,14 @@
 
 #include <algorithm>
 #include <iostream>
+#include <random>
 using namespace std;
 #define il inline
-#define re register
 #define D double
 
 il int read() {
-    re int x = 0, f = 1;
-    re char c = getchar();
+    int x = 0, f = 1;
+    char c = getchar();
     while (c < '0' || c > '9') {
         if (c == '-')
             f = -1;
@@ -27,7 +27,7 @@ il int read() {
     return x * f;
 }
 
-#define rep(i, s, t) for (re int i = s; i <= t; ++i)
+#define rep(i, s, t) for (int i = s; i <= t; ++i)
 #define eps 1e-12
 #define maxn 100005
 #define ff(x) (x) * (x)
@@ -71,7 +71,9 @@ il void work() {
 int main() {
     n = read();
     rep(i, 1, n) scanf("%lf%lf", &e[i].x, &e[i].y);
-    random_shuffle(e + 1, e + n + 1);
+    std::random_device rd;
+    std::mt19937 g(rd());
+    std::shuffle(e + 1, e + n + 1, g);
     work();
     printf("%.10lf\n%.10lf %.10lf", r, o.x, o.y);
 

Problems/AShowOffCat.md

@@ -0,0 +1,49 @@
+# A show-off cat
+
+## Background and Problem description
+
+The cat living next to DB, always a fan of shiny objects (Baling~ Baling~), has taken up a hobby of mining diamonds in her spare time!  She has collected \( N \) diamonds of varying sizes, and she wants to arrange some of them in **a pair of**  display cases in her cattery.
+
+Since she wants the diamonds in each of the two cases to be relatively similar in  size, she decides that she will not include two diamonds in the same case if their sizes differ by more than \( K \) (two diamonds can be displayed together in the same case if their sizes differ by exactly \( K \)).  Given \( K \), please help her determine the maximum number of diamonds she can display in both cases together.
+
+## Input format
+
+The first line of the input file contains \( N \) and \( K \).
+
+The next \( N \) lines each contain an integer giving the size of one of the
+
+diamonds.  All sizes will be positive and will not exceed $1,000,000,000$.
+
+## Output format
+
+Output a single positive integer, telling the maximum number of diamonds that
+
+**She can showcase in total in both the cases.**
+
+## Sample input and output
+
+### Input
+
+```in
+7 3
+10
+5
+1
+12
+9
+5
+14
+```
+
+### Output
+
+```out
+5
+```
+
+## Constraints
+
+For 100% of the test cases:
+
+- \( N \leq 50,000 \)
+- \( 0 \leq K \leq 1,000,000,000 \)

Problems/A_show-off_cat.md

@@ -0,0 +1,79 @@
+# Gambling games
+
+## Problem Description
+
+As an OIer who loves gambling, you have received a rare ticket to enter the only profitable casino in the world. There are \( n \) prize pools in the casino, and the bonus of the \( i_{th} \) prize pool is \( a_i \). Each prize pool has a parameter \( b_i \) (\( 1 \le b_i \le n \))
+
+The casino rules are as follows:,
+
+At the beginning, players will be provided with a prize pool, and whenever they are given the \( i_{th} \) prize pool, they have two options:
+
+1. Obtain the prize money from this prize pool.
+2. Skip the prize money in this pool, so they will never be able to receive the prize money in this pool.
+
+Afterwards, the casino will offer players another prize pool based on the following rules
+
+If the player selects prize pool \( i \), they will choose a prize pool within the range of \( j \le i \)
+
+If the player skips prize pool \( i \), they will choose a prize pool within the range of \( j \le b_i \)
+
+Among these prize pools, it will choose the one with the highest index, which has never been given to players before (players have neither selected nor skipped it before). If there is no such prize pool, then the player's gambling is over, and their prize money is equal to the total prize money of all the selected prize pools. Especially, if players choose the first prize pool, their gambling is over. Note that players can receive a maximum of one prize pool per game.
+
+Now that you have arrived at this casino, please write a program to calculate the maximum bonus you can receive.
+
+## Input format
+
+Sure, let's translate the given problem constraints and details into LaTeX.
+
+## Problem Statement in LaTeX
+
+Each test consists of multiple test cases.
+
+The first line contains an integer \( t \) — the number of test cases.
+
+The description of the test cases is as follows:
+
+- The first line of each test case contains an integer \( n \) — the number of prize pools.
+- The second line of each test case contains \( n \) integers \( a_1, a_2, \ldots, a_n \) — the prize money in the prize pool.
+- The third line of each test case contains \( n \) integers \( b_1, b_2, \ldots, b_n \) — the parameters of the prize pool.
+
+## Output format
+
+For each test case, output an integer, representing the highest score you can obtain.
+
+## Sample input and output
+
+### Input
+
+```in
+4
+2
+15 16
+2 1
+5
+10 10 100 100 1000
+3 4 1 1 1
+3
+100 49 50
+3 2 2
+4
+100 200 300 1000
+2 3 4 1
+```
+
+### Output
+
+```out
+16
+200
+100
+1000
+```
+
+## Constraints
+
+For all test cases:
+
+- \( 1 \leq t \leq 10^5 \)
+- \( 1 \leq n \leq 4 \cdot 10^5 \)
+- \( 1 \leq a_i \leq 10^9 \)

Problems/Gambling games.md

@@ -1,3 +1,4 @@
+# Let's make friends ***!***
 
 ## Background and Problem description
 
@@ -7,13 +8,12 @@ To solve this problem, they found a dictionary to help them understand what the
 
 ## Input format
 
-The first line of input contains the message described in a certain language. This message will not contain more than **10<sup>6</sup>** characters. There will be exactly one whitespace between adjacent words, and the end of the line will be marked with \$. Characters after \$ will not be considered part of the message. 
+The first line of input contains the message described in a certain language. This message will not contain more than \( 10^6 \) characters. There will be exactly one whitespace between adjacent words, and the end of the line will be marked with **\$**. Characters after **\$** will not be considered part of the message.
 
-The following line contains the sentence described in another language, which we need to find in the first line. This sentence will also not be longer than **10<sup>6</sup>** characters and will follow the same format as described above.
+The following line contains the sentence described in another language, which we need to find in the first line. This sentence will also not be longer than \( 10^6 \) characters and will follow the same format as described above.
 
 Except for the last character \$, all other characters are English letters and spaces.
 
-
 ## Output format
 
 Output the position where the sentence from the second line first appears in the message from the first line.
@@ -22,12 +22,15 @@ Output the position where the sentence from the second line first appears in the
 ## Sample input and output
 
 ### Input
-```
+
+```in
 miao meow meow woof hello $
 ga quack moo $
 ```
+
 ### Output
-```
+
+```out
 3
 ```
 

Problems/GamblingGames.md

@@ -1,37 +1,37 @@
 # Shortest path of the king
 
-## 题目描述
+## Background
 
-The king is left alone on the chessboard. In spite of this loneliness, he doesn't lose heart, because he has business of national importance. For example, he has to pay an official visit to square $ t $ . As the king is not in habit of wasting his time, he wants to get from his current position $ s $ to square $ t $ in the least number of moves. Help him to do this.
+The king is left alone on the chessboard. In spite of this loneliness, he doesn't lose heart, because he has business of national importance. For example, he has to pay an official visit to square \( t \) . As the king is not in habit of wasting his time, he wants to get from his current position \( s \) to square \( t \) in the least number of moves. Help him to do this.
 
- ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF3A/5ee13bc754378d9b20e7cf9389534f02014d55d0.png)
+ ![Chessboard](https://cdn.luogu.com.cn/upload/vjudge_pic/CF3A/5ee13bc754378d9b20e7cf9389534f02014d55d0.png)
 
 In one move the king can get to the square that has a common side or a common vertex with the square the king is currently in (generally there are 8 different squares he can move to).
 
 ## 输入格式
 
-The first line contains the chessboard coordinates of square $ s $ , the second line — of square $ t $ .
+The first line contains the chessboard coordinates of square \( s \) , the second line — of square \( t \) .
 
 Chessboard coordinates consist of two characters, the first one is a lowercase Latin letter (from a to h), the second one is a digit from 1 to 8.
 
 ## 输出格式
 
-In the first line print $ n $ — minimum number of the king's moves. Then in $ n $ lines print the moves themselves. Each move is described with one of the 8: L, R, U, D, LU, LD, RU or RD.
+In the first line print \( n \) — minimum number of the king's moves. Then in \( n \) lines print the moves themselves. Each move is described with one of the 8: L, R, U, D, LU, LD, RU or RD.
 
 L, R, U, D stand respectively for moves left, right, up and down (according to the picture), and 2-letter combinations stand for diagonal moves. If the answer is not unique, print any of them.
 
 ## 样例 #1
 
 ### 样例输入 #1
 
-```
+```in
 a8
 h1
 ```
 
 ### 样例输出 #1
 
-```
+```out
 7
 RD
 RD
@@ -40,4 +40,4 @@ RD
 RD
 RD
 RD
-```
+```