[완전탐색] 소수찾기: 프로그래머스

from itertools import permutations
def solution(numbers):
    answer = 0
    num_li= []
    for i in range(len(numbers)):
        num_li.append(numbers[i])
    per_li = []
    for num in range(1,len(numbers)+1):
        tmp_li = list(permutations(num_li,num))
        for j in tmp_li:
            per_li.append(int("".join(j)))

    cnt = 0
    prime_li = []
    for m in per_li:
        if m==0 or m==1 or m in prime_li:
            prime=False
            continue
        prime = True

        for n in range(2,m):
            if m%n==0:
                prime=False
                break
        if prime == True:
            cnt+=1
            prime_li.append(m)
        
    return cnt