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

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

Author: pre-commit-ci[bot]

content/2_Bronze/Precomp.mdx

@@ -102,64 +102,47 @@ Then for every pair of cows, we just check the positions for every contest to se
 
 
 ```cpp
-#include <iostream>
 #include <fstream>
+#include <iostream>
 #include <vector>
 
-
 int main() {
-    std::ifstream infile("gymnastics.in");
-    std::ofstream outfile("gymnastics.out");
-
-
-    int K, N;
-    infile >> K >> N;
-
-
-    std::vector<std::vector<int>> positions(K, std::vector<int>(N + 1));
-   
-    for (int i = 0; i < K; ++i) {
-        for (int j = 0; j < N; ++j) {
-            int cow;
-            infile >> cow;
-            positions[i][cow] = j;
-        }
-    }
-
-
-    int consistent_pairs = 0;
-
-
-    for (int i = 1; i <= N; ++i) {
-        for (int j = i + 1; j <= N; ++j) {
-            bool i_before_j = true;
-            bool j_before_i = true;
-            for (int s = 0; s < K; ++s) {
-                if (positions[s][i] > positions[s][j]) {
-                    i_before_j = false;
-                }
-                if (positions[s][j] > positions[s][i]) {
-                    j_before_i = false;
-                }
-            }
-            if (i_before_j || j_before_i) {
-                consistent_pairs++;
-            }
-        }
-    }
-
-
-    outfile << consistent_pairs << std::endl;
-
-
-    infile.close();
-    outfile.close();
-    return 0;
+	std::ifstream infile("gymnastics.in");
+	std::ofstream outfile("gymnastics.out");
+
+	int K, N;
+	infile >> K >> N;
+
+	std::vector<std::vector<int>> positions(K, std::vector<int>(N + 1));
+
+	for (int i = 0; i < K; ++i) {
+		for (int j = 0; j < N; ++j) {
+			int cow;
+			infile >> cow;
+			positions[i][cow] = j;
+		}
+	}
+
+	int consistent_pairs = 0;
+
+	for (int i = 1; i <= N; ++i) {
+		for (int j = i + 1; j <= N; ++j) {
+			bool i_before_j = true;
+			bool j_before_i = true;
+			for (int s = 0; s < K; ++s) {
+				if (positions[s][i] > positions[s][j]) { i_before_j = false; }
+				if (positions[s][j] > positions[s][i]) { j_before_i = false; }
+			}
+			if (i_before_j || j_before_i) { consistent_pairs++; }
+		}
+	}
+
+	outfile << consistent_pairs << std::endl;
+
+	infile.close();
+	outfile.close();
+	return 0;
 }
-
-
-
-
 ```
 
 
@@ -171,55 +154,45 @@ int main() {
 import java.util.*;
 
 public class Main {
-    public static void main(String[] args) {
-        Scanner scanner = new Scanner(System.in);
-        String inputData = scanner.useDelimiter("\\A").next();
-        String[] data = inputData.split("\\s+");
-        
-        int K = Integer.parseInt(data[0]);
-        int N = Integer.parseInt(data[1]);
-        int index = 2;
-
-        List<int[]> positions = new ArrayList<>();
-        for (int i = 0; i < K; i++) {
-            int[] ranking = new int[N];
-            for (int j = 0; j < N; j++) {
-                ranking[j] = Integer.parseInt(data[index++]);
-            }
-
-            // Precompute positions of each cow
-            int[] pos = new int[N + 1];
-            for (int rank = 0; rank < N; rank++) {
-                pos[ranking[rank]] = rank;
-            }
-            positions.add(pos);
-        }
-
-        int consistentPairs = 0;
-
-        for (int i = 1; i <= N; i++) {
-            for (int j = i + 1; j <= N; j++) {
-                boolean iBeforeJ = true;
-                boolean jBeforeI = true;
-                for (int s = 0; s < K; s++) {
-                    if (positions.get(s)[i] > positions.get(s)[j]) {
-                        iBeforeJ = false;
-                    }
-                    if (positions.get(s)[j] > positions.get(s)[i]) {
-                        jBeforeI = false;
-                    }
-                }
-                if (iBeforeJ || jBeforeI) {
-                    consistentPairs++;
-                }
-            }
-        }
-
-        System.out.println(consistentPairs);
-    }
+	public static void main(String[] args) {
+		Scanner scanner = new Scanner(System.in);
+		String inputData = scanner.useDelimiter("\\A").next();
+		String[] data = inputData.split("\\s+");
+
+		int K = Integer.parseInt(data[0]);
+		int N = Integer.parseInt(data[1]);
+		int index = 2;
+
+		List<int[]> positions = new ArrayList<>();
+		for (int i = 0; i < K; i++) {
+			int[] ranking = new int[N];
+			for (int j = 0; j < N; j++) {
+				ranking[j] = Integer.parseInt(data[index++]);
+			}
+
+			// Precompute positions of each cow
+			int[] pos = new int[N + 1];
+			for (int rank = 0; rank < N; rank++) { pos[ranking[rank]] = rank; }
+			positions.add(pos);
+		}
+
+		int consistentPairs = 0;
+
+		for (int i = 1; i <= N; i++) {
+			for (int j = i + 1; j <= N; j++) {
+				boolean iBeforeJ = true;
+				boolean jBeforeI = true;
+				for (int s = 0; s < K; s++) {
+					if (positions.get(s)[i] > positions.get(s)[j]) { iBeforeJ = false; }
+					if (positions.get(s)[j] > positions.get(s)[i]) { jBeforeI = false; }
+				}
+				if (iBeforeJ || jBeforeI) { consistentPairs++; }
+			}
+		}
+
+		System.out.println(consistentPairs);
+	}
 }
-
-
 ```
 
 
@@ -229,7 +202,8 @@ public class Main {
 
 ```py
 import sys
-sys.stdin = open("gymnastics.in","r")
+
+sys.stdin = open("gymnastics.in", "r")
 sys.stdout = open("gymnastics.out", "w")
 input_data = sys.stdin.read().split()
 
@@ -241,30 +215,30 @@ index = 2
 
 positions = []
 for i in range(K):
-    ranking = list(map(int, input_data[index:index+N]))
-    index += N
-   
-    # Precompute positions of each cow
-    pos = [0] * (N + 1)
-    for rank, cow in enumerate(ranking):
-        pos[cow] = rank
-    positions.append(pos)
+	ranking = list(map(int, input_data[index : index + N]))
+	index += N
+
+	# Precompute positions of each cow
+	pos = [0] * (N + 1)
+	for rank, cow in enumerate(ranking):
+		pos[cow] = rank
+	positions.append(pos)
 
 
 consistent_pairs = 0
 
 
 for i in range(1, N + 1):
-    for j in range(i + 1, N + 1):
-        i_before_j = True
-        j_before_i = True
-        for s in range(K):
-            if positions[s][i] > positions[s][j]:
-                i_before_j = False
-            if positions[s][j] > positions[s][i]:
-                j_before_i = False
-        if i_before_j or j_before_i:
-            consistent_pairs += 1
+	for j in range(i + 1, N + 1):
+		i_before_j = True
+		j_before_i = True
+		for s in range(K):
+			if positions[s][i] > positions[s][j]:
+				i_before_j = False
+			if positions[s][j] > positions[s][i]:
+				j_before_i = False
+		if i_before_j or j_before_i:
+			consistent_pairs += 1
 
 
 print(consistent_pairs)