dfs:
#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#define N 1000005
#include<algorithm>
using namespace std;
int a[N],v[N];
int n;
void print()
{
for(int i=1; i<=n; i++)
printf("%d ",a[i]);
puts("");
}
void dfs(int dep)
{
if(dep==n)
print();
dep++;
for(int i=1; i<=n; i++)
if(v[i])
continue;
else
{
v[i]=1;
a[dep]=i;
dfs(dep);
v[i]=0;
}
}
int main()
{
memset(a,0,sizeof(a));
memset(v,0,sizeof(v));
scanf("%d",&n);
dfs(0);
}
STL
#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#define N 1000005
#include<algorithm>
using namespace std;
int a[100005];
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
a[i]=i;
do
{
for(int i=1;i<=n;i++)
printf("%d ",a[i]);
printf("\n");
}while(next_permutation(a+1,a+n+1));
}