룰루코딩

문제솔루션import sysinput = sys.stdin.readlinesys.setrecursionlimit(10000)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): if i%2 == 0: continue if isPrime(number*10+i): ..

문제솔루션import syssys.setrecursionlimit(10000)input = sys.stdin.readlinen,m = map(int,input().split())A = [[] for _ in range(n+1)]visited = [False] * (n+1)def DFS(v): visited[v] = True for i in A[v]: if not visited[i]: DFS(i) for _ in range(m): u,v = map(int,input().split()) A[u].append(v) A[v].append(u) count=0for i in range(1,n+1): if not visited[..