[BOJ]15656번: N과 M (7) (c++)

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

15656번: N과 M (7)

 

 

#include <iostream>
#include <algorithm>
 
using namespace std;
 
const int MAX = 7;
int numbers[MAX];
int output[MAX];
 
void dps(int N, int M, int depth)
{
    if (depth == M)
    {
        for (int i = 0; i < M; ++i)
        {
            cout << output[i] << ' ';
        }
        cout << '\n';
        return;
    }
 
    // 오름차순, 중복 허용
    for (int i = 0; i < N; ++i)
    {
        output[depth] = numbers[i];
        dps(N, M, depth + 1);
    }
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    int N, M;
    cin >> N >> M;
 
    for (int i = 0; i < N; ++i)
    {
        cin >> numbers[i];
    }
 
    // 정렬
    sort(numbers, numbers + N);
 
    dps(N, M, 0);
 
    return 0;
}