def prime_number(num) : for i in range(2, num) : if num % i == 0 : return False return True from itertools import permutations def solution(numbers): per = [] for i in range(1, len(numbers)+1) : a = list(set(permutations(numbers, i))) for j in a : per.append(int(''.join(j))) per = set(per) - set(range(0,2)) answer = 0 for num in per : if prime_number(num) : answer += 1 return answer 풀이 1) 순열 조합만..