๋ฌธ์
https://www.acmicpc.net/problem/15664
์ฝ๋
#include <iostream>
#include <vector>
#include <algorithm>
#define max 9
using namespace std;
int N, M;
int arr[max];
bool visitied[max];
vector<int>v;
void dfs(int num, int start) {
if (start == M) {
for (int i = 0; i < M; i++) {
cout << arr[i] << ' ';
}
cout << "\n";
}
else {
int check = -1;
for (int i = num; i <= N; i++) {
if (!visitied[i] && v[i - 1] != check) {
visitied[i] = true;
check = v[i - 1];
arr[start] = v[i - 1];
dfs(i, start+1);
visitied[i] = false;
}
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> N >> M;
for (int i = 0; i < N; i++) {
int num; cin >> num;
v.push_back(num);
}
sort(v.begin(), v.end());
dfs(1, 0);
}
'Algorithm ๐ง๐ปโ๐ป > ๋ฐฑ์ค(BOJ)' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[๋ฐฑ์ค,c++] 15688๋ฒ - ์ ์ ๋ ฌํ๊ธฐ5 (0) | 2021.12.14 |
---|---|
[๋ฐฑ์ค,c++] 15666๋ฒ - N๊ณผ M (12) (0) | 2021.12.04 |
[๋ฐฑ์ค,c++] 15665๋ฒ - N๊ณผ M (11) (0) | 2021.12.04 |
[๋ฐฑ์ค,c++] 15663๋ฒ - N๊ณผ M (9) (0) | 2021.12.04 |
[๋ฐฑ์ค,c++] 15657๋ฒ - N๊ณผ M (8) (0) | 2021.12.04 |
[๋ฐฑ์ค,c++] 15656๋ฒ - N๊ณผ M (7) (0) | 2021.12.04 |
๋๊ธ