N과 M (2)

#include <iostream>
using namespace std;

int n, m;
int used[10];
int path[10];
void run(int lev, int now) {
	if (lev == m) {
		for (int i = 0; i < m; i++) {
			cout << path[i] << " ";
		}
		cout << "\n";
		return;
	}
	for (int i = now; i <= n; i++) {
		if (used[i] == 1)continue;
		used[i] = 1;
		path[lev] = i;
		run(lev + 1, i + 1);

	}
}
int main() {

	cin >> n >> m;
	run(0, 1);
	return 0;
}

2다음 3,,