Cod sursa(job #1652763)
Utilizator | Lup Ionut rudarel | Data | 15 martie 2016 13:23:45 |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <stdio.h>
int n, k, sol[10];
void Back(int k)
{
int i, j, ok;
if(k == n)
{
for(i = 1; i <= n; i++) printf("%d ",sol[i]);
printf("\n");
}
else for(i = 1; i <= n; i++)
{
ok = 1;
for(j = 1; j <= k; j++)
if(sol[j] == i) { ok = 0; break; }
if(ok) { sol[k+1] = i; Back(k+1); }
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
Back(0);
return 0;
}