Pagini recente » Cod sursa (job #1574233) | Cod sursa (job #118845) | Cod sursa (job #1298044) | Solutii Winter Challenge 2008, Runda 1 | Cod sursa (job #155767)
Cod sursa(job #155767)
# include <stdio.h>
# define input "permutari.in"
# define output "permutari.out"
# define max 10
int n,u[max],a[max];
void afiseaza()
{
for(int i = 1;i<=n ;i++)
printf("%d ",a[i]);
printf("\n");
}
void back(int k)
{
if(k == n+1)
afiseaza();
else
{
for(int i = 1;i<=n;i++)
{
if(!u[i])
{
u[i] = 1;
a[k] = i;
back(k+1);
u[i] = 0;
}
}
}
}
int main()
{
freopen(input, "r", stdin);
freopen(output, "w", stdout);
scanf("%d",&n);
back(1);
return 0;
}