def CheckPrime(n): if '0' in n or n == '1' : return False n = int(n) for i in range(2, n): if n % i == 0 : return False return True def solution(n, k): answer = 0 num = '' while (True) : num += str(n % k) n //= k if n == 0 : break num = num[::-1] if CheckPrime(num) : # num 자체가 소수일 때 (조건 4) return num else : # 조건 1 ~ 조건 3 start = 0 for i in range(len(num)) : if num[i] == '0' : if i != start and C..