Pagini recente » Cod sursa (job #1473893) | Cod sursa (job #1655422) | Cod sursa (job #2890610) | Cod sursa (job #404813) | Cod sursa (job #352508)
Cod sursa(job #352508)
#include <stdio.h>
#define N 101
int n,sol[N];
bool v[N];
//bool valid(int x);
void afisare();
void bkt(int p);
int main(){
freopen("date.in","r",stdin);
freopen("date.out","w",stdout);
scanf("%d",&n);
bkt(1);
return 0;
}
/*bool valid(int x){
for (int i=1;i<x;i++)
if(sol[i]==sol[x])
return false;
return true;
}*/
void bkt(int p){
if (p==n+1){
afisare();
return;
}
for(int i=1;i<n;i++){
//sol[p]=i;
//if(valid(i)){
if(!v[i]){
sol[p]=i;
v[i]=true;
bkt(p+1);
v[i]=false;
}
//v[i]=false;
}
//return;
}
void afisare(){
for(int i=1;i<=n;i++)
printf("%d ",sol[i]);
printf("\n");
//return;
}