Computer Science/백준 알고리즘
[백준] 15651번 N과 M (3) (파이썬)
roytravel
2022. 6. 29. 23:57
def recursion():
if M == len(picked):
print (*picked)
return
for i in range(N):
picked.append(i+1)
recursion()
picked.pop()
if __name__ == "__main__":
N, M = list(map(int, input().split()))
picked = []
recursion()