From 40eabd2c02796633da2ba9583ebf59bdfb7d441f Mon Sep 17 00:00:00 2001
From: suyeun84 <81475092+suyeun84@users.noreply.github.com>
Date: Sat, 20 Sep 2025 23:18:32 +0900
Subject: [PATCH] =?UTF-8?q?[20250920]=20PGM=20/=20LV3=20/=20N=EC=9C=BC?=
 =?UTF-8?q?=EB=A1=9C=20=ED=91=9C=ED=98=84=20/=20=EA=B9=80=EC=88=98?=
 =?UTF-8?q?=EC=97=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...4\353\241\234 \355\221\234\355\230\204.md" | 40 +++++++++++++++++++
 1 file changed, 40 insertions(+)
 create mode 100644 "suyeun84/202509/20 PGM LV3 N\354\234\274\353\241\234 \355\221\234\355\230\204.md"

diff --git "a/suyeun84/202509/20 PGM LV3 N\354\234\274\353\241\234 \355\221\234\355\230\204.md" "b/suyeun84/202509/20 PGM LV3 N\354\234\274\353\241\234 \355\221\234\355\230\204.md"
new file mode 100644
index 00000000..a4af31ad
--- /dev/null
+++ "b/suyeun84/202509/20 PGM LV3 N\354\234\274\353\241\234 \355\221\234\355\230\204.md"	
@@ -0,0 +1,40 @@
+```java
+import java.util.*;
+
+class Solution {
+    public int solution(int N, int number) {
+        if (N == number) return 1;
+        List<HashSet<Integer>> dp = new ArrayList<>();
+        
+        for (int i = 0; i <= 8; i++) {
+            dp.add(new HashSet<>());
+        }
+        
+        dp.get(1).add(N);
+        
+        for (int i = 2; i <= 8; i++) {
+            // 순수한 수
+            StringBuilder sb = new StringBuilder();
+            for (int j = 0; j < i; j++) {
+                sb.append(N);
+            }
+            dp.get(i).add(Integer.parseInt(sb.toString()));
+            // 사칙연산한 수
+            for (int j = 0; j < i; j++) {
+                int k = i - j;
+                for (int num1 : dp.get(j)) {
+                    for (int num2 : dp.get(k)) {
+                        dp.get(i).add(num1+num2);
+                        dp.get(i).add(num1-num2);
+                        dp.get(i).add(num1*num2);
+                        if (num2 != 0) dp.get(i).add(num1/num2);
+                    }
+                }
+            }
+            if (dp.get(i).contains(number)) return i;
+        }
+        
+        return -1;
+    }
+}
+```