프로그래머스 Lv2 | 완전탐색 | 소수 찾기

https://school.programmers.co.kr/learn/courses/30/lessons/42839#

프로그래머스

 

import math
from itertools import permutations

def prime(number):
    if number == 0 or number == 1:
        return 0
    for i in range(2,math.floor(math.sqrt(number))+1):
        if number%i==0:
            return 0 # 소수가 아니다
    return 1 # 소수이다

def make_number(combination):
    number = ''
    for c in combination:
        number += c
    return number
    
def solution(numbers):
    number_list = [c for c in numbers]
    prime_list = set()
    for i in range(1, len(number_list)+1):
        for c in permutations(number_list,i):
            number = int(make_number(c))
            if prime(number):
                prime_list.add(number)

    return len(prime_list)