알고리즘 /Backtracking
[백준] N과 M (3)_15651
장주아
2019. 8. 12. 21:25
순열을 만드는 부분에서 중복을 체크하는 select[i] 부분을 빼면 된다.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
|
#include <iostream>
#include <vector>
using namespace std;
int N, M;
vector<int> v;
void print() {
for (int i = 0; i < M; i++) {
cout << v[i] << " ";
}
cout << "\n";
}
void dfs(int cnt) {
if (cnt == M) {
print();
return;
}
for (int i = 0; i < N; i++) {
v.push_back(i + 1);
dfs(cnt + 1);
v.pop_back();
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >> N >> M;
dfs(0);
return 0;
}
http://colorscripter.com/info#e" target="_blank" style="color:#e5e5e5text-decoration:none">Colored by Color Scripter
|
http://colorscripter.com/info#e" target="_blank" style="text-decoration:none;color:white">cs |