Pagini recente » Cod sursa (job #3138924) | Cod sursa (job #1526549) | Cod sursa (job #1680948) | Infoarena Monthly 2014 - Clasament | Cod sursa (job #1317150)
#include <cstdio>
using namespace std;
int sol[41000];
int n;
bool valid (int p){
for(int i=1;i<p;i++)
if(sol[i]==sol[p]) return false;
return true;
}
void afisare (){
for( int i=1;i<=n;i++)
printf("%d ",sol[i]);
printf("\n");
}
void bkt (int p){
if(p-1==n) afisare ();
else
for(int i=1;i<=n;i++){
sol[p]=i;
if(valid(p)) bkt(p+1);
}
}
int main(){
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
bkt(1);
return 0;
}