시나위

from itertools import permutations def solution(numbers): answer = 0 ## permutation of elements of numbers c_arr = list(set(map(int, [''.join(j) for i in range(len(numbers)) for j in permutations(numbers, i+1)]))) ## Sieve of Eratosthenes prime_num=[] max_arr=max(c_arr) chk=[False]*2+[True]*(max_arr-1) for i in range(2,max_arr+1): if chk[i]: prime_num.append(i) for j in range(2*i,max_arr+1,i): i..

첫번째 시도 def solution(n): answer = 0 prime_num=[] for i in range(2,n+1): for j in range(2,i+1): if (i%j==0): if (i!=j): break prime_num.append(i) answer = len(prime_num) return answer 효율이 좋지 않아서(시간초과되어서) 전체를 다 풀지 못하였다. 두번째 시도 def solution(n): answer = 0 prime_num=[] for i in range(2,n+1): chk=True for j in prime_num: if (i%j==0): # if i isnt primenum chk=False # chk changes false break if chk: # c..