用DFS产生全排列 太强了系列

https://blog.youkuaiyun.com/qq_40763929/article/details/81629800

#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;
}