Pagini recente » Cod sursa (job #2787425) | Cod sursa (job #225942) | Cod sursa (job #469077) | Cod sursa (job #228925) | Cod sursa (job #1298113)
#include<fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n,x[100];
void sol(int m){
for(int i=1;i<=m;i++){
fout<<x[i]<<" ";
}
fout<<"\n";
}
int count(int k){
int i;
for(i=1;i<k;i++){
if(x[i]==x[k])
return 0;
}
return 1;
}
void bk(int k){
if(k==n+1){
sol(n);
}else{
int i;
for(i=1;i<=n;i++){
x[k]=i;
if(count(k)){
bk(k+1);
}
}
}
}
int main(){
fin>>n;
bk(1);
return 0;
}