From f983a470e8d763d45df01fb78284ed0f2574b672 Mon Sep 17 00:00:00 2001
From: LiiNi-coder <97495437+LiiNi-coder@users.noreply.github.com>
Date: Wed, 24 Dec 2025 20:08:24 +0900
Subject: [PATCH] =?UTF-8?q?[20251224]=20BOJ=20/=20G4=20/=20=ED=94=8C?=
 =?UTF-8?q?=EB=A1=9C=EC=9D=B4=EB=93=9C=20/=20=EC=9D=B4=EC=9D=B8=ED=9D=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...14\353\241\234\354\235\264\353\223\234.md" | 56 +++++++++++++++++++
 1 file changed, 56 insertions(+)
 create mode 100644 "LiiNi-coder/202512/24 BOJ \355\224\214\353\241\234\354\235\264\353\223\234.md"

diff --git "a/LiiNi-coder/202512/24 BOJ \355\224\214\353\241\234\354\235\264\353\223\234.md" "b/LiiNi-coder/202512/24 BOJ \355\224\214\353\241\234\354\235\264\353\223\234.md"
new file mode 100644
index 00000000..80ea5011
--- /dev/null
+++ "b/LiiNi-coder/202512/24 BOJ \355\224\214\353\241\234\354\235\264\353\223\234.md"	
@@ -0,0 +1,56 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+	static final int INF = 1_000_000_000;
+
+	public static void main(String[] args) throws IOException {
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		int N = Integer.parseInt(br.readLine());
+		int M = Integer.parseInt(br.readLine());
+		int[][] dist = new int[N + 1][N + 1];
+		for(int i = 1; i <= N; i++){
+			for(int j = 1; j <= N; j++){
+				if(i == j){
+					dist[i][j] = 0;
+				} else {
+					dist[i][j] = INF;
+				}
+			}
+		}
+
+		for(int i = 0; i < M; i++){
+			StringTokenizer st = new StringTokenizer(br.readLine());
+			int s = Integer.parseInt(st.nextToken());
+			int e = Integer.parseInt(st.nextToken());
+			int w = Integer.parseInt(st.nextToken());
+			dist[s][e] = Math.min(dist[s][e], w);
+		}
+		//플루이드워셜
+		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];
+					}
+				}
+			}
+		}
+		
+		StringBuilder sb = new StringBuilder();
+		for(int i = 1; i <= N; i++){
+			for(int j = 1; j <= N; j++){
+				if(dist[i][j] == INF){
+					sb.append(0).append(" ");
+				} else {
+					sb.append(dist[i][j]).append(" ");
+				}
+			}
+			sb.append("\n");
+		}
+		System.out.println(sb.toString());
+	}
+}
+
+```