|
์ฝ๋ ์์ฑํ๊ธฐ
from itertools import permutations
import math
def isPrime(n) :
if n==0 or n==1 :
return False
for i in range(2, math.sqrt(n)+1):
if n%i==0 :
return False
return True
def solution(numbers):
answer=[]
numbers=list(map(int, numbers))
for i in range(1, len(numbers)+1) :
nums=list(set(permutations(numbers, i)))
for num in nums :
number=int(''.join(map(str, num)))
if isPrime(number) :
answer.append(number)
return len(set(answer))
Python
๋ณต์ฌ
|
์ฝ๋ ์ค๋ช
ํ๊ธฐ
1.
numbers๋ฅผ ํ๊ธ์์ฉ ์๋ผ list๋ฅผ ์์ฑํ๋ค.
2.
1๋ถํฐ numbers์ ๊ธธ์ด๋งํผ ์กฐํฉ์ ์์ฑํ๋ค.
a.
์์ฑํ ์กฐํฉ์ ์ซ์๋ก ๋ฐ๊พผ๋ค.
b.
์์์ธ์ง ํ๋ณํ๊ณ ์์์ด๋ฉด answer์ ์ถ๊ฐํ๋ค
3.
์ค๋ณต๋๋ ๊ฐ์ด ์์์๋ ์์ผ๋ฏ๋ก set์ ํด์ค ํ ๊ธธ์ด๋ฅผ ๋ฐํํ๋ค.