백준 15665 N과 M (11) c++

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

15665번: N과 M (11)

 

 

코드

/*boj s2 15665 N과 M (11)*/
#include <algorithm>
#include <iostream>
#define MAXN 105
using namespace std;

int N, M;
int arr[MAXN];
int ans[MAXN];

void func(int k) {
    if (k == M) {
        for (int m = 0; m < M; m++) {
            cout << ans[m] << " ";
        }
        cout << "\n";
        return;
    }

    int tmp = 0;
    for (int j = 0; j < N; j++) {
        if (tmp == arr[j]) continue; // 똑같은 수를 또 넣음
        ans[k] = arr[j];
        tmp = arr[j];
        func(k + 1);
    }
}

int main(void) {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> N >> M;
    for (int i = 0; i < N; i++)
        cin >> arr[i];

    sort(arr, arr + N);

    func(0);
}