백준 15650 c++ N과 M (2)

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

---

#include <iostream>

using namespace std;

bool visit[8];
int result[8];

void dfs(int start, int n, int m, int cnt)
{
	if (cnt == m)
	{
		for (int i = 0; i < m; i++)
		{
			cout << result[i] << ' ';
		}
		cout << '\n';
	}
	for (int i = start; i <= n; i++)
	{
		if (visit[i] == false) 
		{
			result[cnt] = i;
			visit[i] = true;
			dfs(i,n, m, cnt + 1);
			visit[i] = false;
		}
	}
}

int main()
{
	int n, m;
	cin >> n >> m;
	dfs(1, n, m, 0);
}