Cod sursa(job #793266)
| Utilizator | Data | 2 octombrie 2012 13:45:38 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int a[10000];
int viz[10];
int n;
void afisare()
{
for(int i = 0 ; i < n ; ++i)
printf("%d ",a[i]);
printf("\n");
}
void back(int k)
{
if(k == n)
{
afisare();
return;
}
for(int v=1; v<=n ; ++v)
{
if(!viz[v])
{
viz[v]=1;
a[k]=v;
back(k+1);
viz[v]=0;
}
}
}
int main()
{
freopen("permutari.in" , "r" , stdin);
freopen("permutari.out" , "w" , stdout);
scanf("%d",&n);
back(0);
return 0;
}
