😎 코딩테스트 연습>2022 KAKAO BLIND RECRUITMENT>k진수에서 소수 개수 구하기
import math
def conv(n, k):
rev_base = ''
while n > 0:
rev_base += str(n%k)
n = n//k
return rev_base[::-1]
def solution(n, k):
answer = 0
rev_base = conv(n,k)
for i in rev_base.split('0'):
plug = 0
if i != '' and i != '1':
i = int(i)
for j in range(2, int(math.sqrt(i)) + 1):
if i%j == 0:
plug = 1
break
if plug == 0:
answer += 1
return answer