python/C++专题课程/深度优先搜索/最简全排列.cpp

#include<iostream>
#include<cmath>
using namespace std;

int p[10]= {0};
bool vis[10]= {0};
int n;
void dfs(int x) {
	if (x==n+1) {
		for(int i=1; i<=n; i++)
			cout<<p[i]<<" ";
		cout<<endl;
		return ;
	}

	for (int i=1; i<=n; i++) {
		if (vis[i]==false  ) {
			p[x] = i;
			vis[i] = true;
			dfs(x+1);
			vis[i] = false;
		}
	}
}

int main() {
	while (cin>>n) {
		dfs(1);
	}
	return 0;
}