완전탐색 - 소수 찾기 / 파이썬

from itertools import permutations

def ck(num):
    ck_num = 0
    for i in range(2, num+1):
        if num % i == 0:
            ck_num += 1
        if ck_num == 2:
            return False
    return True

def solution(numbers):
    answer = 0
    num_set = set()
    for i in range(1, len(numbers)+1):
        lst = list(map(''.join, permutations(numbers, i)))
        for j in lst:
            if int(j) <= 1: continue
            num_set.add(int(j))
    for n in num_set:
        if ck(n):
            answer += 1
    return answer

 

from itertools import permutations

list(map(''.join, permutations(numbers, i)))

외우기 !!!!!

 

programmers.co.kr/learn/courses/30/lessons/42839

코딩테스트 연습 - 소수 찾기