#include <iostream>
#include <algorithm>
using namespace std;
int a[10];
int num[10];
int c[10];
void go(int index, int start, int n, int m) {
if (index == m) {
for (int i=0; i<m; i++) {
cout << num[a[i]];
if (i != m-1) cout << ' ';
}
cout << '\n';
return;
}
for (int i=start; i<n; i++) {
if (c[i]) continue;
c[i] = true;
a[index] = i;
go(index+1, i+1, n, m);
c[i] = false;
}
}
int main() {
int n, m;
cin >> n >> m;
for (int i=0; i<n; i++) {
cin >> num[i];
}
sort(num,num+n);
go(0,0,n,m);
return 0;
}
#include <iostream>
#include <algorithm>
using namespace std;
int a[10];
int num[10];
void go(int index, int selected, int n, int m) {
if (selected == m) {
for (int i=0; i<m; i++) {
cout << num[a[i]] << ' ';
}
cout << '\n';
return;
}
if (index >= n) return;
a[selected] = index;
go(index+1, selected+1, n, m);
a[selected] = 0;
go(index+1, selected, n, m);
}
int main() {
int n, m;
cin >> n >> m;
for (int i=0; i<n; i++) {
cin >> num[i];
}
sort(num,num+n);
go(0,0,n,m);
return 0;
}
'Problem set' 카테고리의 다른 글
[백준] 15657 N과 M (8) (0) | 2021.01.21 |
---|---|
[백준] 15656 N과 M (7) (0) | 2021.01.21 |
[백준] 15654 N과 M (5) (0) | 2021.01.21 |
[백준] 15652 N과 M (4) (0) | 2021.01.21 |
[백준] 15651 N과 M (3) (0) | 2021.01.21 |