[백준] 15651번: N과 M(3)

15651번: N과 M (3)

 

#include<iostream>
#include<vector>
using namespace std;

int n, m;

void dfs(int size, int now, vector<int>arr) {

	if (size < now) {
		for (int i = 0;i < arr.size();i++) {
			cout << arr[i] << ' ';
		}
		cout << '\n';
		return;
	}

	for (int i = 1;i <= n;i++) {
			arr.push_back(i);
			dfs(size, now + 1, arr);
			arr.pop_back();
	}
}

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