백준 BOJ 15652 C++ [N과 M (4)]

#include <bits/stdc++.h>
using namespace std;

int n, m, arr[9];

void dfs(int level) {
    if (level > m) {
        for (int i = 1; i <= m; ++i) {
            cout << arr[i] << ' ';
        }
        cout << '\n';
        return;
    }
    for (int i = arr[level - 1]; i <= n; ++i) {
        arr[level] = i;
        dfs(level + 1);
    }
}

void solve() {
    cin >> n >> m;
    arr[0] = 1;
    dfs(1);
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    solve();
    return 0;
}