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

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

Author: pre-commit-ci[bot]

content/3_Silver/Func_Graphs.mdx

@@ -729,78 +729,78 @@ import java.io.*;
 import java.util.*;
 
 public class Badge {
-    static int[] ans;
-    static int[] arr;
-    public static void main(String[] args) throws IOException {
-        BufferedReader x = new BufferedReader(new InputStreamReader(System.in));
-        StringTokenizer st = new StringTokenizer(x.readLine());
-        int n = Integer.parseInt(st.nextToken());
-        arr = new int[n + 1];
-        st = new StringTokenizer(x.readLine());
-        for (int i = 1; i <= n; i++) {
-            arr[i] = Integer.parseInt(st.nextToken());
-        }
-
-        ans = new int[n + 1];
-        Arrays.fill(ans, -1);
-        for (int i = 1; i <= n; i++) {
-            if (ans[i] == -1) { floyd(i); }
-        }
-
-        StringBuilder output = new StringBuilder();
-        for (int i = 1; i <= n; i++) { output.append(ans[i]).append(" "); }
-        output.setLength(output.length() - 1);
-        System.out.println(output);
-    }
-
-    /**
-     * fills up all vertices from curr to firstCycle,
-     * whose answer has already been calculated
-     */
-    static void fill_up(int curr, int first_cycle) {
-        while (curr != first_cycle) {
-            ans[curr] = ans[first_cycle];
-            curr = arr[curr];
-        }
-    }
-
-    static int floyd(int curr) {
-        int a = arr[curr];
-        int b = arr[arr[curr]];
-        // find cycle using Floyd's algo
-        while (a != b) {
-            /*
-             * while finding cycle, if a node is found out to be already
-             * calculated, go to the fillUp function, where, the answer from
-             * vertex curr to this vertex a is ans[a]
-             */
-            if (ans[a] != -1) {
-                fill_up(curr, a);
-                return 0;
-            }
-            a = arr[a];
-            b = arr[arr[b]];
-        }
-        a = curr;
-        while (a != b) {
-            a = arr[a];
-            b = arr[b];
-        }
-        int cycle_first = a;
-        a = curr;
-
-        while (a != cycle_first) {
-            ans[a] = cycle_first;
-            a = arr[a];
-        }
-        a = cycle_first;
-        // for each node in the cycle, the answer would be itself
-        do {
-            ans[a] = a;
-            a = arr[a];
-        } while (a != cycle_first);
-        return 0;
-    }
+	static int[] ans;
+	static int[] arr;
+	public static void main(String[] args) throws IOException {
+		BufferedReader x = new BufferedReader(new InputStreamReader(System.in));
+		StringTokenizer st = new StringTokenizer(x.readLine());
+		int n = Integer.parseInt(st.nextToken());
+		arr = new int[n + 1];
+		st = new StringTokenizer(x.readLine());
+		for (int i = 1; i <= n; i++) {
+			arr[i] = Integer.parseInt(st.nextToken());
+		}
+
+		ans = new int[n + 1];
+		Arrays.fill(ans, -1);
+		for (int i = 1; i <= n; i++) {
+			if (ans[i] == -1) { floyd(i); }
+		}
+
+		StringBuilder output = new StringBuilder();
+		for (int i = 1; i <= n; i++) { output.append(ans[i]).append(" "); }
+		output.setLength(output.length() - 1);
+		System.out.println(output);
+	}
+
+	/**
+	 * fills up all vertices from curr to firstCycle,
+	 * whose answer has already been calculated
+	 */
+	static void fill_up(int curr, int first_cycle) {
+		while (curr != first_cycle) {
+			ans[curr] = ans[first_cycle];
+			curr = arr[curr];
+		}
+	}
+
+	static int floyd(int curr) {
+		int a = arr[curr];
+		int b = arr[arr[curr]];
+		// find cycle using Floyd's algo
+		while (a != b) {
+			/*
+			 * while finding cycle, if a node is found out to be already
+			 * calculated, go to the fillUp function, where, the answer from
+			 * vertex curr to this vertex a is ans[a]
+			 */
+			if (ans[a] != -1) {
+				fill_up(curr, a);
+				return 0;
+			}
+			a = arr[a];
+			b = arr[arr[b]];
+		}
+		a = curr;
+		while (a != b) {
+			a = arr[a];
+			b = arr[b];
+		}
+		int cycle_first = a;
+		a = curr;
+
+		while (a != cycle_first) {
+			ans[a] = cycle_first;
+			a = arr[a];
+		}
+		a = cycle_first;
+		// for each node in the cycle, the answer would be itself
+		do {
+			ans[a] = a;
+			a = arr[a];
+		} while (a != cycle_first);
+		return 0;
+	}
 }
 ```
 </JavaSection>