1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
def jinsu(n, k) :
    jinsu = ''
    while n > 0 :
        n, mod = divmod(n, k)
        jinsu += str(mod)
    return jinsu[::-1]

def isprime(i) :
    if i == 1:
        return False
    elif i == 2 :
        return True
    for n in range(2, i) :
        if i%n == 0 :
            return False
    return True

def solution(n, k) :
    clu = jinsu(n, k).split('0')
    prime = []
    for c in clu :
        if c.isdigit() and isprime(int(c)) :
            prime.append(int(c))
    return len(prime)