Pagini recente » soldiers | Cod sursa (job #2012890) | Cod sursa (job #3291444) | Monitorul de evaluare | Cod sursa (job #144640)
Cod sursa(job #144640)
#include <stdio.h>
int N, uz[16], p[16];
void back(int nivel)
{
int i;
if (nivel == N+1)
{
for (i = 1; i <= N; i++)
printf("%d ", p[i]);
printf("\n");
return ;
}
for (i = 1; i <= N; ++i)
if (!uz[i])
{
uz[i] = 1;
p[nivel] = i;
back(nivel+1);
uz[i] = 0;
}
}
int main(void)
{
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &N);
back(1);
return 0;
}