-
Notifications
You must be signed in to change notification settings - Fork 0
/
소수찾기.py
44 lines (31 loc) · 813 Bytes
/
소수찾기.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
# -*- coding: utf-8 -*-
"""
Created on Fri Nov 12 21:46:35 2021
@author: user
"""
#프로그래머스
#level 02
#소수 찾기
numbers = "17"
#numbers = "011"
from itertools import permutations
#소수 판별 함수
def is_prime_number(x) :
if x < 2 :
return False
for i in range(2, x) :
if x % i == 0 :
return False
return True
def solution(numbers):
answer = 0
num = []
for i in range(1, len(numbers)+1) :
#순열 모듈 사용해서 나올 수 있는 모든 수 조합
num.append(list(set(map(''.join, permutations(numbers, i)))))
per = list(set(map(int, set(sum(num, [])))))
for p in per :
if is_prime_number(p) == True :
answer += 1
return answer
print(solution(numbers))