[백준 15649] N과 M(1).cpp

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

15649번: N과 M (1)

	#include <stdio.h>
	// Global Variable
	int N, M;
	bool visited[9];
	int saved_arr[9];
	// Definition
	void Input();
	void Dfs(int cnt);
	// Main
	int main() {
	Input();
	Dfs(0);
	}
	// Declaration
	void Input() {
	freopen("input.txt", "r", stdin);
	scanf("%d %d", &N, &M);
	}
	void Dfs(int cnt) {
	if (cnt == M) {
	for (int i = 0; i < M; i++) {
	printf("%d ", saved_arr[i]);
	}
	printf("\n");
	return;
	}
	for (int i = 1; i <= N; i++) {
	if (visited[i] == true) continue;
	visited[i] = true;
	saved_arr[cnt] = i;
	Dfs(cnt + 1);
	visited[i] = false;
	}
	}

view raw <15649> N과 M(1) hosted with ❤ by GitHub