Cod sursa(job #1004432)
Utilizator | Data | 2 octombrie 2013 18:42:42 | |
---|---|---|---|
Problema | Evaluarea unei expresii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <stdio.h>
int n,a[10],b[10];
void back(int x)
{
if (x>n)
{
for (int j=1; j<=n; ++j)
printf("%d ",a[j]);
printf("\n");
return;
}
int i;
for (i=1; i<=n; ++i)
{
if (b[i]==1) continue;
a[x]=i;
b[i]=1;
back(x+1);
b[i]=0;
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}