Cod sursa(job #1010258)
Utilizator | Niculae Alexandru Vlad AlexNiuclae | Data | 14 octombrie 2013 17:05:30 |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <cstdio>
using namespace std;
int a[100],i,n,k;
bool pus[100];
void afisare()
{ int i;
for (i=1;i<=n;i++) printf("%d ", a[i]);
printf("\n");
}
void back(int k)
{ int i;
if (k>n) afisare();
else
for (i=1;i<=n;i++)
if (!pus[i]) {
a[k]=i;
pus[i]=true;
back(k+1);
pus[i]=false;
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d", &n);
back(1);
return 0;
}