[백준] N과 M (시리즈)

www.acmicpc.net/workbook/view/2052

문제집: N과 M (시리즈)

백트래킹을 연습하기 위해 4번까지 풀었다.

15649

n, m = map(int, input().split())
visited = [0] * (n + 1)

def asdf(index=0, arr=[], key=m, end=n):
    if index == key:
        print(' '.join(map(str, arr)))
    else:
        for i in range(1,end+1):
            if visited[i] == 0:
                visited[i] = 1
                asdf(index + 1, arr + [i])
                visited[i] = 0

asdf()

 

15650

n, m = map(int, input().split())

def asdf(index=0, start=1, end=n, key=m, arr=[]):
    if index == key:
        print(' '.join(map(str, arr)))
    else:
        for i in range(start, end+1):
            asdf(index=index+1, start=i+1, arr= arr+[i])


asdf()

 

15651

n, m = map(int, input().split())

def asdf(index=0, end=n, key=m, arr=[]):
    if index == key:
        print(' '.join(map(str, arr)))
    else:
        for i in range(1, end+1):
            asdf(index=index+1, arr= arr+[i])


asdf()

 

15652

n, m = map(int, input().split())

def asdf(index=0, start=1,end=n, key=m, arr=[]):
    if index == key:
        print(' '.join(map(str, arr)))
    else:
        for i in range(start, end+1):
            asdf(index=index+1, start=i , arr= arr+[i])


asdf()