[백준/Python(파이썬)] 15650 N과 M (2)

2021-02-07

문제 : https://www.acmicpc.net/problem/15650

 

이번에는 조합으로 풀었다

 

[소스코드]

https://github.com/jisun1125/algorithm-problem-solving/blob/main/baekjoon/no_15650.py

 

from itertools import permutations, combinations

n, m = map(int, input().split())
k = []
for i in range(n):
k.append(i+1)
per = combinations(k, m)
for p in per:
for i in p:
print(i, end=' ')
print('')