From a9aa71da92a26f4bd6f56ea6bafcd2f4ebf7e93d Mon Sep 17 00:00:00 2001
From: lkhyun <102892446+lkhyun@users.noreply.github.com>
Date: Thu, 9 Oct 2025 15:03:04 +0900
Subject: [PATCH] =?UTF-8?q?[20251009]=20PGM=20/=20Lv2=20/=20k=EC=A7=84?=
 =?UTF-8?q?=EC=88=98=EC=97=90=EC=84=9C=20=EC=86=8C=EC=88=98=20=EA=B0=9C?=
 =?UTF-8?q?=EC=88=98=20=EA=B5=AC=ED=95=98=EA=B8=B0=20/=20=EC=9D=B4?=
 =?UTF-8?q?=EA=B0=95=ED=98=84?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...0 \352\265\254\355\225\230\352\270\260.md" | 34 +++++++++++++++++++
 1 file changed, 34 insertions(+)
 create mode 100644 "lkhyun/202510/09 PGM Lv2 k\354\247\204\354\210\230\354\227\220\354\204\234 \354\206\214\354\210\230 \352\260\234\354\210\230 \352\265\254\355\225\230\352\270\260.md"

diff --git "a/lkhyun/202510/09 PGM Lv2 k\354\247\204\354\210\230\354\227\220\354\204\234 \354\206\214\354\210\230 \352\260\234\354\210\230 \352\265\254\355\225\230\352\270\260.md" "b/lkhyun/202510/09 PGM Lv2 k\354\247\204\354\210\230\354\227\220\354\204\234 \354\206\214\354\210\230 \352\260\234\354\210\230 \352\265\254\355\225\230\352\270\260.md"
new file mode 100644
index 00000000..e326288a
--- /dev/null
+++ "b/lkhyun/202510/09 PGM Lv2 k\354\247\204\354\210\230\354\227\220\354\204\234 \354\206\214\354\210\230 \352\260\234\354\210\230 \352\265\254\355\225\230\352\270\260.md"	
@@ -0,0 +1,34 @@
+```java
+class Solution {
+    public int solution(int n, int k) {
+        int answer = 0;
+        String[] numbers = convertor(n,k).split("0+");
+        for(String num : numbers){
+            if(!num.isEmpty() && isPrime(Long.parseLong(num))){
+                answer++;
+            }
+        }
+        return answer;
+    }
+    public String convertor(int n, int k){
+        StringBuilder sb = new StringBuilder();
+        
+        while(n > 0){
+            sb.append(n%k);
+            n /= k;
+        }
+        return sb.reverse().toString();
+    }
+    public boolean isPrime(long number){
+        if(number == 1) return false;
+        if(number == 2) return true;
+        if(number%2 == 0) return false;
+        for(long i=3; i*i <= number; i+=2){
+            if(number%i == 0){
+                return false;
+            }
+        }
+        return true;
+    }
+}
+```