조합

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
	vector<int> vc;
	vector<int> metric;
	for (int i = 0; i < 4; i++) {
		vc.push_back(i);
		metric.push_back(0);
	}
	for (int i = 0; i < 2; i++) {
		metric[i] = 1;
	}
	sort(metric.begin(), metric.end());
	vector<vector<int>> temp;
	do {
		vector<int> temp2;
		for (int i = 0; i < metric.size(); i++) {
			if (metric[i] == 1) {
				temp2.push_back(vc[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;
}