全排列(P2524 Uim的情人节礼物·其之弐 P2525 Uim的情人节礼物·其之壱)

https://blog.csdn.net/qq_40679299/article/details/79344050?utm_medium=distribute.pc_relevant.none-task-blog-2_defaultbaidujs_baidulandingword~default-0.no_search_link&spm=1001.2101.3001.4242.1
或
https://blog.csdn.net/liushall/article/details/80072159

#include
using namespace std;
int n,top = 0;//z为方案总数 ， 
int a[10010],ans[10010],pos[10010];

void visit()
{
	for(int i = 0; i < n ; i++)
		pos[i] = 1; //表示未访问 
}

void dfs(int deep) //
{
	if(deep == 2)
	{
		for(int i = 0;i < 2; i++)
			cout<>n;
	for(int i = 0; i < n; i++)
		cin>>a[i];
	visit();
	dfs(0);
	return 0;
}