백준 N과 M(5)

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

15654번: N과 M (5)

백트래킹 연습용 3

#include <iostream>
#include <vector>
#include <queue>
#include<string>
#include<algorithm>
#include<cmath>
#include<unordered_map>
#include<map>
#include<stack>
using namespace std;

struct Point {
	int i, j, t, cnt, power;
	char c;
};

void Prints(vector<vector<int>>maps, int n, int m) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << maps[i][j] << " ";
		}
		cout << endl;
	}
	cout << endl;
}

void Prints(vector<vector<bool>>maps, int n, int m) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << maps[i][j] << " ";
		}
		cout << endl;
	}
	cout << endl;
}
void Prints(vector<vector<char>>maps, int n, int m) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << maps[i][j];
		}
		cout << endl;
	}
	cout << endl;
}
void Prints(vector<vector<vector<char>>>maps, int n, int m, int k) {
	for (int t = 0; t < k; t++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				cout << maps[t][i][j];
			}
			cout << endl;
		}
		cout << endl;
	}
	cout << endl;
}

void Prints(vector<vector<vector<bool>>>maps, int n, int m, int k) {
	for (int t = 0; t < k; t++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				cout << maps[t][i][j];
			}
			cout << endl;
		}
		cout << endl;
	}
	cout << endl;
}
void Prints(vector<int>line, int n) {
	for (int i = 0; i < n; i++) {
		cout << line[i] << ",";
	}
	cout << endl;
}
void Prints(string str, int n) {
	for (int i = 0; i < n; i++) {
		cout << str[i] << ",";
	}
	cout << endl;
}

bool checkmaps(vector<vector<int>>maps, vector<vector<int>>anw, int n, int m) {
	bool bCheck = false;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (maps[i][j] != anw[i][j]) {
				bCheck = true;
				i = n + 1;
				j = m + 1;
				continue;
			}
		}

	}
	return bCheck;

}
bool findstart(vector<vector<int>>maps, vector<vector<int>>anw, int n, int m, int) {
	bool bCheck = false;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (maps[i][j] != anw[i][j]) {
				bCheck = true;
				i = n + 1;
				j = m + 1;
				continue;
			}
		}

	}
	return bCheck;

}

struct Data {
	long long s;
	long long t;

};
struct GDatas {
	int change;
	int index;

	string times;

};
bool cmp(const Data &a, const Data &b) {
	if (a.s == b.s) {
		return a.t < b.t;
	}

	return a.s < b.s;
}
int n, m;
vector<int>lists;
vector<bool>gbCheck;
void dfs(int k, int cnt, vector<int>save) {
	if (cnt >= m) {
		for (int i = 0; i < save.size(); i++) {
			cout << save[i] << " ";
		}
		cout << '\n';
		save.clear();
		return;
	}

	for (int i = 0; i < lists.size(); i++) {
		if (gbCheck[i] == false) {
			gbCheck[i] = true;
			save.push_back(lists[i]);

			dfs(i, cnt + 1, save);
			save.pop_back();
			gbCheck[i] = false;
		}



	}

}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);


	cin >> n >> m;
	vector<bool>bCheck(n, false);
	gbCheck = bCheck;
	//3 1 
	for (int i = 0; i < n; i++) {
		//1 2 3 4 
		int tmp;
		cin >> tmp;
		lists.push_back(tmp);
	}
	sort(lists.begin(), lists.end());
	vector<int>save;
	for (int i = 0; i < n; i++) {
		save.push_back(lists[i]);
		gbCheck[i] = true;
		dfs(i, 1, save);
		gbCheck[i] = false;
		save.pop_back();
	}

	return 0;
}