(C++) - 백준(BOJ) 15650번 : N과 M (2)

#include <iostream>
using namespace std;
int n, m;
int a[9];
int ck[9];
void DFS(int t,int k)
{
    if (t == m)
    {
        for (int i = 0; i < m; i++)
            cout << a[i] << ' ';
        cout << '\n';
        return;
    }
    for (int i = k; i <= n; i++)
    {
        if (ck[i] == 0)
        {
            ck[i] = 1;
            a[t] = i;
            DFS(t+1,i+1);
            ck[i] = 0;
        }
    }
}
 
int main() {
    cin >> n >> m;
    DFS(0,1);
}