백준 2023번: 신기한 소수

https://www.acmicpc.net/problem/2023

2023번: 신기한 소수

import sys
sys.setrecursionlimit(10000)
input = sys.stdin.readline
n = int(input())
 
def isPrime(num):
    for i in range(2, int(num/2+1)):
        if num % i==0:
            return False
    return True
 
def DFS(number):
    if len(str(number))==n:
        print(number)
    else:
        for i in range(1,10,2):
            if i%2 == 0:
                continue
            if isPrime(number*10+i):
                DFS(number*10+i)
 
DFS(2)
DFS(3)
DFS(5)
DFS(7)