행렬 경우의수

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
	vector<int> metric;
	metric.push_back(0);
	metric.push_back(1);
	metric.push_back(1);
	metric.push_back(1);

	sort(metric.begin(), metric.end()); // 중요중요
	vector<vector<int>> temp;
	do {
		vector<int> temp2;
		for (int i = 0; i < metric.size(); i++) {
				temp2.push_back(metric[i]);
		}
		temp.push_back(temp2);
	} while (next_permutation(metric.begin(), metric.end()));
	
	for (int i = 0; i < temp.size(); i++) {
		for (int k = 0; k < temp[i].size(); k++) {
			cout<<temp[i][k];
		}
		cout << endl;
	}
	system("pause");
	return 0;
}