From 41933e19af9b3201a62b7b26bacd7dea6ee058d1 Mon Sep 17 00:00:00 2001 From: LiiNi-coder <97495437+LiiNi-coder@users.noreply.github.com> Date: Wed, 28 Jan 2026 23:56:59 +0900 Subject: [PATCH] =?UTF-8?q?[20260128]=20BOJ=20/=20G4=20/=20=ED=8A=B8?= =?UTF-8?q?=EB=A6=AC=EC=9D=98=20=EC=A7=80=EB=A6=84(=EB=AC=BC=EC=9D=8C?= =?UTF-8?q?=ED=91=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 --- ...(\353\254\274\354\235\214\355\221\234).md" | 42 +++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 "LiiNi-coder/202601/28 BOJ \355\212\270\353\246\254\354\235\230 \354\247\200\353\246\204(\353\254\274\354\235\214\355\221\234).md" diff --git "a/LiiNi-coder/202601/28 BOJ \355\212\270\353\246\254\354\235\230 \354\247\200\353\246\204(\353\254\274\354\235\214\355\221\234).md" "b/LiiNi-coder/202601/28 BOJ \355\212\270\353\246\254\354\235\230 \354\247\200\353\246\204(\353\254\274\354\235\214\355\221\234).md" new file mode 100644 index 00000000..61b0ad3b --- /dev/null +++ "b/LiiNi-coder/202601/28 BOJ \355\212\270\353\246\254\354\235\230 \354\247\200\353\246\204(\353\254\274\354\235\214\355\221\234).md" @@ -0,0 +1,42 @@ +```java +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.StringTokenizer; +import java.util.Queue; +import java.util.LinkedList; + +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 k = Integer.parseInt(st.nextToken()); + + solve(n, k); + } + + private static void solve(int n, int k) { + Queue q = new LinkedList(); + q.offer(1); + int next = 2; + int edgeCount = 0; + while (!q.isEmpty() && next <= n) { + int current = q.poll(); + for (int i = 0; i < k && next <= n; i++) { + System.out.println(current + " " + next); + q.offer(next); + next++; + edgeCount++; + + + if (edgeCount == n - 1) { + return; + } + } + } + } +} + +```