Cod sursa(job #733475)
Utilizator | Denis Mita Kira96 | Data | 12 aprilie 2012 12:12:41 |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<stdio.h>
int sol[15],n;
void back(int k)
{
if(k>n)
{ for(int i=1;i<=n;++i) printf("%d ",sol[i]);
printf("\n"); }
else
{ for(int i=1;i<=n;++i){
bool found = false;
for(int j=1;j<k;j++) if(sol[j]==i) { found = true; break ; }
if(!found) { sol[k]=i; back (k + 1) ; }
}
}
}
int main ()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}