Cod sursa(job #910153)
| Utilizator | Data | 10 martie 2013 19:02:36 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <cstdio>
#define NMAX 9
using namespace std;
int n;
int sol[NMAX];
bool viz[NMAX];
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] = 1;
Back(k + 1);
viz[i] = 0;
}
}
int main()
{
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &n);
Back(0);
return 0;
}
