[백준] 15650번 N과 M (2) / C++

#include <iostream>

#define MAX 9
using namespace std;

int n, m;
int arr[MAX] = { 0 };
int visited[MAX] = { 0 };

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

	for (int i = num; i <= n; ++i)
	{
		if (!visited[i])
		{
			visited[i] = true;
			arr[cnt] = i;
			dfs(i + 1, cnt + 1);
			visited[i] = false;
		}
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	cin >> n >> m;

	dfs(1, 0);

	return 0;
}