[BOJ] 15651번 : N과 M (3)

1. problem : 

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

 

2. solution 1:

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

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] = i + 1;
		backTrack(k + 1);
	}
}
int main(void) {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> M;
	backTrack(0);

}