algorithmStudy/15663.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
61
62
63
64
65
66
67
68
69
70
71
72
//
//  15663.cpp
//  algo
//
//  Created by 박효정 on 2021/09/22.
//

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

using namespace std;

int n,m;
int vis[9];
vector<int>ve;
vector<string>s;
vector<string>lis;


void dfs(){

    if(s.size()==m){

        for(int i=0;i<s.size();i++){
            cout<<s[i]<<' ';
        }
        cout<<"\n";
        return;
    }

    int pre=-1;
    for(int j=0;j<n;j++){
        if(vis[j]==0&&pre!=ve[j]){
            vis[j]=1;
            pre=ve[j];
            s.push_back(to_string(ve[j]));
            dfs();
            s.pop_back();
            vis[j]=0;
        }
    }


}

int main(){

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

    cin>>n>>m;

    for(int i=0;i<n;i++){
        int input;
        cin>>input;
        ve.push_back(input);
    }

    sort(ve.begin(), ve.end());
    dfs();


    return 0;
}