Pagini recente » Cod sursa (job #1178354) | Cod sursa (job #1013422) | Cod sursa (job #1949689) | Cod sursa (job #93966) | Cod sursa (job #1026301)
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int n,a[10],viz[10];
int cont(int x){
for(int i=1;i<=x-1;i++)
if(a[i]==a[x])
return 0;
return 1;}
void scrie(int x){
for(int i=1;i<=n;i++)
out<<a[i]<<" ";
out<<'\n';
}
void back(int k){
int i;
for(i=1;i<=n;i++){
if(viz[i]==0){
a[k]=i;
viz[i]=1;
if(k==n)
scrie(k);
else
back(k+1);
viz[i]=0;
}
}
}
int main(){
in>>n;
back(1);
return 0;}