[백준 문제풀이] 얼렁뚱땅 10974 모든 순열 풀이

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

 

n = int(input())
visited = [0] * n

def dfs(depth) :
	if depth == n :
		print(*visited)
	else :
		for i in range(n) :
			if i+1 in visited :
				continue
			visited[depth] = i+1
			dfs(depth+1)
			visited[depth] = 0

dfs(0)

다들 천재야 ...