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<Integer> q = new LinkedList<Integer>();
+        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;
+                }
+            }
+        }
+    }
+}
+
+```