python-algorithm
백준 15650 N과 M (2)
무적김두칠
2022. 1. 10. 13:17
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
|
n,m=map(int,input().split())
s=[]
ans=[]
def dfs():
if len(s)==m:
tmpAns=sorted((map(int,s)))
if tmpAns not in ans :ans.append(tmpAns)
return
for i in range(1, n+1):
if i not in s:
s.append(i)
dfs()
s.pop()
dfs()
for i in ans:
print(*i)
|
cs |
반응형