백준 15652번: N과 M (4) #Python

ColorlessDia·2025년 8월 27일

algorithm/baekjoon

목록 보기
647/808
def back_track(current_number, current_sequence, all_sequence):

    if M == len(current_sequence):
        all_sequence.append(list(current_sequence))
        return
    
    for i in range(current_number, N + 1):
        current_sequence.append(i)

        back_track(i, current_sequence, all_sequence)

        current_sequence.pop()

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

all_sequence = []

back_track(1, [], all_sequence)

for sequence in all_sequence:
    print(*sequence)

0개의 댓글