Computer Science/백준 알고리즘

[백준] 15649번 N과 M (1) (파이썬)

roytravel 2022. 6. 29. 23:55
N, M = list(map(int, input().split()))
picked = []
array = [i for i in range(N)]
n = len(array)

def permutation():
    if len(picked) == M:
        print (' '.join(str(i) for i in picked))
        return
    else:
        for i in range(1, n+1):
            if i not in picked:
                picked.append(i)
                permutation()
                picked.pop()
permutation()