Pagini recente » Cod sursa (job #1073242) | Cod sursa (job #136851) | Cod sursa (job #1081434) | Istoria paginii runda/concurs_2 | Cod sursa (job #918778)
Cod sursa(job #918778)
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int s[100],n;
void afis(){
for(int i=1;i<=n;i++)
out<<s[i]<<" ";
out<<endl;
}
int valid(int k){
for(int i=1;i<k;i++)
if(s[i]==s[k])return 0;
return 1;
}
void init(int k){ s[k]=0;}
void bkt(int k){
if(k==n+1) afis();
else{init(k);
while(s[k]<n){s[k]++;
if(valid(k))bkt(k+1);}
}
}
int main(){
cin>>n;
bkt(1);
}