algorithmStudy/15649.cpp at master · judy5050/algorithmStudy · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
//
//  15649.cpp
//  algo
//
//  Created by 박효정 on 2021/05/13.
//

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int n,m;
int ch[9];
int arr[9];

void dfs(int c){

    if(c==m){
        for(int i=0;i<m;i++){
            cout<<arr[i]<<" ";
        }
        cout<<"\n";
        return;
    }
    else{
        //아직 선택전이면
        for(int i=1;i<=n;i++){
            if(ch[i]==0){
                ch[i]=1;
                arr[c]=i;
                dfs(c+1);
                ch[i]=0;
            }
        }

    }

}


int main(){

    cin.tie(0);
    cout.tie(0);
    std::ios::sync_with_stdio(false);

    cin>>n>>m;

    dfs(0);


    return 0;
}