Cod sursa(job #220250)
Utilizator | Data | 9 noiembrie 2008 23:22:26 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <cstdio>
#define MAX_N 10
int N;
bool viz[MAX_N];
int sol[MAX_N];
void afisare()
{
for(int i = 0; i < N; ++i)
printf("%d ",sol[i]);
printf("\n");
}
void back(int k)
{
if(k == N)
{
afisare();
return;
}
for(int i = 1; i <= N; ++i)
if(!viz[i])
{
sol[k] = i;
viz[i] = true;
back(k+1);
viz[i] = false;
}
}
int main()
{
freopen("permutari.in","rt",stdin);
freopen("permutari.out","wt",stdout);
scanf("%d",&N);
back(0);
}