Search

๊น€๋ฏผ์ง€

2.๋ฌธ์ œ์ด๋ฆ„
3. ์ˆ˜ํ–‰์‹œ๊ฐ„[์ดˆ(s)]
900
์ข‹์•„์š” ๋ˆ„๋ฅด๊ธฐ
์ข‹์•„์š” ์ˆ˜
: 0
5 more properties
| ์ฝ”๋“œ ์ž‘์„ฑํ•˜๊ธฐ
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์„ ํ•ด์ค€ ํ›„ ๊ธธ์ด๋ฅผ ๋ฐ˜ํ™˜ํ•œ๋‹ค.