Cod sursa(job #965672)
Utilizator | Data | 24 iunie 2013 14:10:50 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<cstdio>
using namespace std;
int f[10], v[10], n;
void back(int k)
{
int i;
if(k == n)
{
for(i = 0; i < n; ++ i)
printf("%d ", v[i]);
printf("\n");
}
else
{
for(i = 1; i <= n; ++ i)
if(! f[i])
{
f[i] = 1;
v[k] = i;
back(k + 1);
f[i] = 0;
}
}
}
int main()
{
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &n);
back(0);
return 0;
}