15655번 - N과 M (6)

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

15655번: N과 M (6)

import sys
N, M = map(int, input().split())
arr = list(map(int, sys.stdin.readline().split()))
arr.sort()
ans = []
isVisited = [False] * N
def dfs(depth):
    if len(ans) == M:
        print(*ans)
        return
    for i in range(depth, N):
        if arr[i] in ans: 
            continue
        if arr[i] in isVisited: 
            continue
        ans.append(arr[i])
        isVisited[i] = True
        dfs(i)
        isVisited[i] = False
        ans.pop()
dfs(0)