Pagini recente » Cod sursa (job #636910) | Cod sursa (job #1142294) | Cod sursa (job #459654) | Cod sursa (job #2972551) | Cod sursa (job #916233)
Cod sursa(job #916233)
#include <cstdio>
int s[10];
int util[10];
int n;
void afis()
{
int i;
for (i = 0; i < n; i++)
printf("%d ", s[i]);
printf("\n");
}
void back(int k)
{
int i;
if (k == n)
afis();
else
for (i = 1; i <= n; i++)
if (!util[i])
{
s[k] = i;
util[i] = 1;
back(k + 1);
util[i] = 0;
}
}
int main()
{
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &n);
back(0);
return 0;
}