https://programmers.co.kr/learn/courses/30/lessons/42839?language=python3
순열을 이용하여 완전탐색을 하는 문제이다.
from itertools import permutations
def is_prime(n):
if n <= 1:
return False
for i in range(2,int(n**(1/2))+1):
if n%i==0:
return False
return True
def solution(numbers):
answer = set()
numbers = list(i for i in numbers)
for i in range(1,len(numbers)+1):
arr = list(map(''.join,permutations(numbers,i)))
for j in arr:
if is_prime(int(j)):
answer.add(int(j))
return len(answer)