[백준] 15651. N과 M (3)(c++)

https://www.acmicpc.net/problem/15651

 

백트래킹보단 그냥 dfs

---

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <string>
#include <cstring>
using namespace std;

using ll = long long;

int arr[8], visited[9];

int n, m;

void dfs(int idx) {
	if (idx == m) {
		for (int i = 0; i < m; i++) {
			cout << arr[i] << " ";
		}
		cout << '\n';
		return;
	}

	for (int i = 1; i <= n; i++) {
//		if (visited[i] || i < arr[idx-1])
//			continue;
//		visited[i] = 1;
		arr[idx] = i;
		dfs(idx + 1);
//		visited[i] = 0;
	}
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	cin >> n >> m;

	dfs(0);


	return 0;
}