From f0701503825f14351d21b2cae961734b7fea41ae Mon Sep 17 00:00:00 2001
From: Donew <47556347+03do-new30@users.noreply.github.com>
Date: Wed, 26 Feb 2025 00:06:51 +0900
Subject: [PATCH] =?UTF-8?q?[20250225]=20BOJ=20/=20=EA=B3=A8=EB=93=9C5=20/?=
 =?UTF-8?q?=20=ED=9A=8C=EC=9E=A5=EB=BD=91=EA=B8=B0=20/=20=EC=8B=A0?=
 =?UTF-8?q?=EB=8F=99=EC=9C=A4?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...14\354\236\245\353\275\221\352\270\260.md" | 70 +++++++++++++++++++
 1 file changed, 70 insertions(+)
 create mode 100644 "03do-new30/202502/25 BOJ G5 \355\232\214\354\236\245\353\275\221\352\270\260.md"

diff --git "a/03do-new30/202502/25 BOJ G5 \355\232\214\354\236\245\353\275\221\352\270\260.md" "b/03do-new30/202502/25 BOJ G5 \355\232\214\354\236\245\353\275\221\352\270\260.md"
new file mode 100644
index 00000000..7fca92e0
--- /dev/null
+++ "b/03do-new30/202502/25 BOJ G5 \355\232\214\354\236\245\353\275\221\352\270\260.md"	
@@ -0,0 +1,70 @@
+```java
+import java.io.*;
+import java.util.*;
+public class Main {
+
+   static final int INF = 50;
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        
+        // 입력
+        int n = Integer.parseInt(br.readLine());
+
+        int[][] dist = new int[n+1][n+1];
+        for (int i = 1; i < n+1; i++) {
+            for (int j = 1; j < n+1; j++) {
+                if (i == j) {
+                    continue;
+                }
+                dist[i][j] = INF;
+            }
+        }
+
+        while (true) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            int u = Integer.parseInt(st.nextToken());
+            int v = Integer.parseInt(st.nextToken());
+            if (u == -1 && v == -1) { break; }
+            dist[u][v] = 1;
+            dist[v][u] = 1;
+        }
+        
+        // 풀이
+        for (int mid = 1; mid < n+1; mid++) {
+            for (int i = 1; i < n+1; i++) {
+                for (int j = 1; j < n+1; j++) {
+                    if (i == j) { continue; }
+                    dist[i][j] = Integer.min(dist[i][j], dist[i][mid] + dist[mid][j]);
+                }
+            }
+        }
+
+        int[] score = new int[n+1];
+        for (int i = 1; i < n+1; i++) {
+            score[i] = Arrays.stream(dist[i]).max().getAsInt();
+        }
+        int minScore = INF;
+        int count = 0;
+        for (int i = 1; i < n+1; i++) {
+            if (score[i] < minScore) {
+                minScore = score[i];
+                count = 1;
+            } else if (score[i] == minScore) {
+                count++;
+            }
+        }
+        
+        // 출력
+        System.out.println(minScore + " " + count);
+        for (int i = 1; i < n+1; i++) {
+            if (score[i] == minScore) {
+                System.out.print(i + " ");
+            }
+        }
+        System.out.println();
+
+        br.close();
+    }
+}
+
+```