Cod sursa(job #793910)
| Utilizator | Data | 4 octombrie 2012 18:09:24 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include<cstdio>
int n,s,a[9]={0},j;
bool ok;
void back (int k)
{
if(k==n+1)
{
for(int i=1;i<=n;++i)
{
printf("%d ",a[i]);
}
printf("\n");
}
else
{
for( int i=1;i<=n;++i)
{
//printf("%d \t",i);;
ok=true;
for(j=1;j<k;++j)
if(a[j]==i)
{
ok=false;
break;
}
if(ok == true)
{
a[k]=i;
back(k+1);
}
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}