From 9ed94ccd7e5b45df769c432698201be534fe8f86 Mon Sep 17 00:00:00 2001
From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com>
Date: Wed, 23 Jul 2025 09:28:15 +0900
Subject: [PATCH] =?UTF-8?q?[20250723]=20BOJ=20/=20G4=20/=20=EC=88=A8?=
 =?UTF-8?q?=EB=B0=94=EA=BC=AD=EC=A7=88=202=20/=20=EC=9D=B4=EC=A4=80?=
 =?UTF-8?q?=ED=9D=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...\353\260\224\352\274\255\354\247\210 2.md" | 62 +++++++++++++++++++
 1 file changed, 62 insertions(+)
 create mode 100644 "JHLEE325/202507/23 BOJ G4 \354\210\250\353\260\224\352\274\255\354\247\210 2.md"

diff --git "a/JHLEE325/202507/23 BOJ G4 \354\210\250\353\260\224\352\274\255\354\247\210 2.md" "b/JHLEE325/202507/23 BOJ G4 \354\210\250\353\260\224\352\274\255\354\247\210 2.md"
new file mode 100644
index 00000000..f5f974f6
--- /dev/null
+++ "b/JHLEE325/202507/23 BOJ G4 \354\210\250\353\260\224\352\274\255\354\247\210 2.md"	
@@ -0,0 +1,62 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    static int[] time = new int[100001];
+    static int[] count = new int[100001];
+    static int n, k;
+
+    public static void main(String[] args) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        n = Integer.parseInt(st.nextToken());
+        k = Integer.parseInt(st.nextToken());
+
+        if (n == k) {
+            System.out.println(0);
+            System.out.println(1);
+            return;
+        }
+
+        Queue<Integer> q = new LinkedList<>();
+        q.add(n);
+        time[n] = 0;
+        count[n] = 1;
+
+        while (!q.isEmpty()) {
+            int cur = q.poll();
+
+            for (int j = 0; j < 3; j++) {
+                int next = 0;
+                switch (j) {
+                    case 0:
+                        next = cur - 1;
+                        break;
+                    case 1:
+                        next = cur + 1;
+                        break;
+                    case 2:
+                        next = cur * 2;
+                        break;
+                }
+
+                if (next < 0 || next > 100000) continue;
+
+                if (time[next] == 0 && next != n) {
+                    time[next] = time[cur] + 1;
+                    count[next] = count[cur];
+                    q.add(next);
+                } else if (time[next] == time[cur] + 1) {
+                    count[next] += count[cur];
+                }
+            }
+        }
+
+        System.out.println(time[k]);
+        System.out.println(count[k]);
+    }
+}
+
+```