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

1. problem :

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

 

 

2. solution 1 :

#include <bits/stdc++.h>
using namespace std;
int ans[8];
int nums[8];
int N, M;

void backTrack(int k) {
	if (k == M) {
		for (int i = 0; i < M; i++) cout << ans[i] << ' ';
		cout << '\n';
		return;
	}
	for (int i = 0; i < N; i++) {
		ans[k] = nums[i];
		backTrack(k + 1);
	}
}

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