#include<cstdio>
using namespace std;
const int N=110;
int n,vis[N],a[N];
void dfs(int x){
if(x==n+1){
for(int i=1;i<=n;i++){
putchar(a[i]+'0');putchar(' ');
}
putchar('
');
return ;
}
for(int i=1;i<=n;i++){
if(!vis[i]){
vis[i]=1;
a[x]=i;
dfs(x+1);
vis[i]=0;
}
}
}
int main(){
scanf("%d",&n);
dfs(1);
return 0;
}
#include<cstdio>
using namespace std;
const int N=1100;int n;
void dfs(){
int top,a[N],vis[N]={0};
a[top=1]=0;
while(top>=1){
if(top==n+1){
for(int i=1;i<=n;i++){
putchar(a[i]+'0');putchar(' ');
}
putchar('
');vis[a[--top]]=0;
continue;
}
do
a[top]++;
while(vis[a[top]]&&a[top]<=n);
if(a[top]<=n)
vis[a[top]]=1,a[++top]=0;
else
vis[a[--top]]=0;
}
}
int main(){
scanf("%d",&n);
dfs();
return 0;
}
#include<cstdio>
#include<algorithm>
using namespace std;
int a[15],n;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++) a[i]=i;
do{
for(int i=1;i<=n;i++){
putchar(a[i]+'0');putchar(' ');
}
putchar('
');
}while(next_permutation(a+1,a+n+1));
return 0;
}
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int N=11000;
int n,s[N];
void dfs(int x){
if(x==n+1){
for(int i=1;i<=n;i++){
printf("%d ",s[i]);
}
putchar('
');
return ;
}
for(int i=x;i<=n;i++){
swap(s[x],s[i]);
dfs(x+1);
swap(s[x],s[i]);
}
}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++) s[i]=i;
dfs(1);
return 0;
}