[백준] 15650번 N과 M (2)

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

15650번: N과 M (2)

#include <stdio.h>

int n,m;
int result[1000];
int check[1000];

void DFS(int depth, int cut){
    
    if(depth == m){
        for(int i=0; i<m; i++){
            printf("%d ",result[i]);
        }
        printf("\n");
    }
    else {
        for(int i=1;i<=n;i++){
            if(check[i]==0 && cut<i){
                result[depth]=i;
                check[i]=1;
                DFS(depth+1,i);
                check[i]=0;
            }
        }
    }
}

int main(void)
{
    scanf("%d %d",&n,&m);
    DFS(0,0);
    return 0;
}