From 9374c1fb3082e1eb0e7af1182545b9ee07e2141a Mon Sep 17 00:00:00 2001
From: Ukj0ng <90972240+Ukj0ng@users.noreply.github.com>
Date: Sat, 13 Sep 2025 23:31:19 +0900
Subject: [PATCH] =?UTF-8?q?[20250913]=20BOJ=20/=20G5=20/=20=EC=88=AB?=
 =?UTF-8?q?=EC=9E=90=EA=B3=A0=EB=A5=B4=EA=B8=B0=20/=20=ED=95=9C=EC=A2=85?=
 =?UTF-8?q?=EC=9A=B1?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...20\352\263\240\353\245\264\352\270\260.md" | 64 +++++++++++++++++++
 1 file changed, 64 insertions(+)
 create mode 100644 "Ukj0ng/202509/13 BOJ G5 \354\210\253\354\236\220\352\263\240\353\245\264\352\270\260.md"

diff --git "a/Ukj0ng/202509/13 BOJ G5 \354\210\253\354\236\220\352\263\240\353\245\264\352\270\260.md" "b/Ukj0ng/202509/13 BOJ G5 \354\210\253\354\236\220\352\263\240\353\245\264\352\270\260.md"
new file mode 100644
index 00000000..2dbf88dd
--- /dev/null
+++ "b/Ukj0ng/202509/13 BOJ G5 \354\210\253\354\236\220\352\263\240\353\245\264\352\270\260.md"	
@@ -0,0 +1,64 @@
+```
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    private static final BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    private static int[] arr;
+    private static boolean[] visited;
+    private static Set<Integer> result;
+    private static int N;
+
+    public static void main(String[] args) throws IOException {
+        init();
+
+        result = new TreeSet<>();
+        visited = new boolean[N + 1];
+
+        for (int i = 1; i <= N; i++) {
+            if (!visited[i]) {
+                DFS(i, i, new HashSet<>());
+            }
+        }
+
+        bw.write(result.size() + "\n");
+        for (int num : result) {
+            bw.write(num + "\n");
+        }
+
+        bw.flush();
+        bw.close();
+        br.close();
+    }
+
+    private static void init() throws IOException {
+        N = Integer.parseInt(br.readLine());
+        arr = new int[N + 1];
+
+        for (int i = 1; i <= N; i++) {
+            arr[i] = Integer.parseInt(br.readLine());
+        }
+    }
+
+    private static void DFS(int current, int start, Set<Integer> path) {
+        if (visited[current]) return;
+
+        if (current == start && !path.isEmpty()) {
+            result.addAll(path);
+            for (int node : path) {
+                visited[node] = true;
+            }
+            return;
+        }
+
+        if (path.contains(current)) {
+            return;
+        }
+
+        path.add(current);
+        DFS(arr[current], start, path);
+        path.remove(current);
+    }
+}
+```