c++ dfs를 이용한 순열

 

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

bool check[9];
int n,m;
vector<int> v;

void dfs(int cnt) 
{
	if(cnt == 3) {
		for(int i=0; i<v.size(); i++) {
			cout << v[i] << " ";
		}
		cout << endl;
	}
	
	for(int i=1; i<=5; i++) {
		if(check[i])	continue;
		check[i] = true;
		v.push_back(i);
		dfs(cnt+1);
		v.pop_back();
		check[i] = false;
	}
	
}


int main(void)
{
	dfs(0);
	
	return 0;
}