Pagini recente » Cod sursa (job #531571) | Cod sursa (job #2956760) | Cod sursa (job #3223360) | Cod sursa (job #2427238) | Cod sursa (job #145817)
Cod sursa(job #145817)
#include <stdio.h>
int N, Q[16], u[16];
void write()
{
for (int i = 1; i < N; ++i)
printf("%d ", Q[i]);
printf("%d\n", Q[i]);
}
void back(int k)
{
if (k == N+1)
write();
else
for (int i = 1; i <= N; ++i)
if (!u[i])
{
Q[k] = i;
u[i] ++;
back(k+1);
u[i] --;
}
}
int main()
{
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &N);
back(1);
return 0;
}