(Python/🥈3)백준 알고리즘 15650번: N과 M (2)

문제 출처:https://www.acmicpc.net/problem/15650

15650번: N과 M (2)

 

풀이:

n,m = map(int,input().split())
visited = [False] * n
result = []

def solve(num):
    if num == m:
        print(*result)
        return

    for i in range(n):
        if visited[i] == False:
            visited[i] = True
            result.append(i + 1)
            solve(num+1)
            visited[i] = True
            result.pop()
            for j in range(i+1, n):
                visited[j] = False

solve(0)

 

처음 i의 DFS 탐색에 사용 된 i값을 제외시키는 것이 순열과 다른 조합의 차이다.

 

 

풀이2:

from itertools import combinations

N, M = map(int, input().split())

p = combinations(range(1, N+1), M)
for i in p:
    print(*i)