From 84196711a1e5a3d38c9acc1976b3ba9edd0905d6 Mon Sep 17 00:00:00 2001
From: llIllIllIllIllIllIllIllI <_@seol.pro>
Date: Mon, 8 Dec 2025 23:54:20 +0900
Subject: [PATCH] =?UTF-8?q?[20251208]=20BOJ=20/=20G5=20/=20=ED=98=B8?=
 =?UTF-8?q?=EC=84=9D=EC=9D=B4=20=EB=91=90=EB=A7=88=EB=A6=AC=20=EC=B9=98?=
 =?UTF-8?q?=ED=82=A8=20/=20=EC=84=A4=EC=A7=84=EC=98=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...0\353\246\254 \354\271\230\355\202\250.md" | 58 +++++++++++++++++++
 1 file changed, 58 insertions(+)
 create mode 100644 "Seol-JY/202512/07 BOJ \355\230\270\354\204\235\354\235\264 \353\221\220\353\247\210\353\246\254 \354\271\230\355\202\250.md"

diff --git "a/Seol-JY/202512/07 BOJ \355\230\270\354\204\235\354\235\264 \353\221\220\353\247\210\353\246\254 \354\271\230\355\202\250.md" "b/Seol-JY/202512/07 BOJ \355\230\270\354\204\235\354\235\264 \353\221\220\353\247\210\353\246\254 \354\271\230\355\202\250.md"
new file mode 100644
index 00000000..ab272755
--- /dev/null
+++ "b/Seol-JY/202512/07 BOJ \355\230\270\354\204\235\354\235\264 \353\221\220\353\247\210\353\246\254 \354\271\230\355\202\250.md"	
@@ -0,0 +1,58 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        
+        int n = Integer.parseInt(st.nextToken());
+        int m = Integer.parseInt(st.nextToken());
+        
+        int[][] dist = new int[n + 1][n + 1];
+        int INF = 1000000;
+        
+        for (int i = 1; i <= n; i++) {
+            Arrays.fill(dist[i], INF);
+            dist[i][i] = 0;
+        }
+        
+        for (int i = 0; i < m; i++) {
+            st = new StringTokenizer(br.readLine());
+            int a = Integer.parseInt(st.nextToken());
+            int b = Integer.parseInt(st.nextToken());
+            dist[a][b] = 1;
+            dist[b][a] = 1;
+        }
+        
+        for (int k = 1; k <= n; k++) {
+            for (int i = 1; i <= n; i++) {
+                for (int j = 1; j <= n; j++) {
+                    if (dist[i][j] > dist[i][k] + dist[k][j]) {
+                        dist[i][j] = dist[i][k] + dist[k][j];
+                    }
+                }
+            }
+        }
+        
+        int ansI = 0, ansJ = 0, ansSum = Integer.MAX_VALUE;
+        
+        for (int i = 1; i <= n; i++) {
+            for (int j = i + 1; j <= n; j++) {
+                int sum = 0;
+                for (int k = 1; k <= n; k++) {
+                    sum += Math.min(dist[k][i], dist[k][j]) * 2;
+                }
+                if (sum < ansSum) {
+                    ansSum = sum;
+                    ansI = i;
+                    ansJ = j;
+                }
+            }
+        }
+        
+        System.out.println(ansI + " " + ansJ + " " + ansSum);
+    }
+}
+```