caioj.1031 搜索初步

生成全排列

#include<bits/stdc++.h>
using namespace std;
template <typename T> void read(T &x){
	x=0;int f=1;char ch=getchar();
	for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-1;
	for(;isdigit(ch);ch=getchar())x=(x<<1)+(x<<3)+ch-'0';
	x*=f;
}

int n;
int a[111];
bool v[111];

void dfs(int k){
	if(k==n+1){
		for(int i=1;i<=n;++i) cout<<a[i]<<" ";
		cout<<endl;
	}
	else{
		for(int i=1;i<=n;++i){
			if(!v[i]){
				a[k]=i;
				v[i]=1;
				dfs(k+1);
				v[i]=0;
				a[k]=0;
			}
		}
	}
} 

int main(){
	read(n);
	memset(v,0,sizeof(v));
	dfs(1);
 	return 0;
}