[백준] 15650_N과 M (2)

[문제]: 15650번: N과 M (2) (acmicpc.net)

 

#include <iostream>
using namespace std;

int n, m;
int arr[10];

void solution(int k, int p)
{
	if (k == m) {
		for (int i = 0; i < m; ++i)
			cout << arr[i] << ' ';
		cout << '\n';
		return;
	}

	for (int i = p + 1; i <= n; ++i) {
		arr[k] = i;
		solution(k + 1, i);
	}
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	cin >> n >> m;
	solution(0, 0);
	return 0;
}