/*PERMUTARI RECURSIV clasa 11 intensiv */
#include <iostream>
using namespace std;
int x[100000],n,k;
void afisare(){
int i;
for(i=1;i<=n;i++) cout<<x[i]<<" ";
cout<<endl;
}
int cont(int k){
int i;
for(i=1;i<=k-1;i++){
if(x[k]==x[i]){ return 0 ;}
}
return 1;
}
void back(int k){ int i;
if(k==n+1) {afisare();}
else{for(i=1;i<=n;i++){x[k]=i;
if(cont(k)) back(k+1);}} }
int main(){
cout<<"Introduceti numarul\n"; cin>>n;
back(1);
cout<<endl;
return 0;}
