Baekjoon 15650번 N과 M (2)

문제

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

걸린 시간

00 : 24 : 44

풀이

C++

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

int n, m;

void solve(vector<int>& seq, int here){
    // 기저 사례
    if(seq.size() == m){
        for(int i = 0; i < seq.size(); i++)
            cout << seq[i] << " ";
        cout << "\n";
        return;
    }
    // 재귀 호출
    for(int next = here+1; next <= n; next++){
        seq.push_back(next);
        solve(seq, next);
        seq.pop_back();
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m;
    vector<int> seq;
    solve(seq, 0);
    return 0;
}