๐ก Python 3
์์ ์ฐพ๊ธฐ [Link]
def solution(n):
from itertools import permutations
nl = []
for r in range(1, len(n)+1):
per = list(permutations(n, r))
nl += [int(''.join(p)) for p in per]
nl = set(nl)
count = 0
for nm in nl:
if nm == 0 or nm == 1:
count += 1
continue
for i in range(2, int(nm**0.5) + 1):
if nm % i == 0:
count += 1
break
return len(nl) - count
set
์ฐ์ฐ์ ๊ธฐ์ตํ์..|
ํฉ์งํฉ,&
๊ต์งํฉ,-
์ฐจ์งํฉ,^
๋์นญ ์ฐจ์งํฉ
from itertools import permutations
def solution(n):
a = set()
for i in range(len(n)):
a |= set(map(int, map("".join, permutations(list(n), i + 1))))
a -= set(range(0, 2))
for i in range(2, int(max(a) ** 0.5) + 1):
a -= set(range(i * 2, max(a) + 1, i))
return len(a)