Pagini recente » Cod sursa (job #270441) | Cod sursa (job #2098010) | Cod sursa (job #2077470) | Cod sursa (job #74424) | Cod sursa (job #1689265)
#include <iostream>
#include <cstdio>
#define MAXN 11
using namespace std;
int n, sol[MAXN], viz[MAXN];
void solutie()
{
for (int i = 1; i <= n; i++)
printf("%d ", sol[i]);
printf("\n");
}
void bt(int k)
{
if (k > n) {
solutie();
return;
}
for (int i = 1; i <= n; i++)
if (!viz[i]) {
viz[i] = 1;
sol[k] = i;
bt(k+1);
viz[i] = 0;
}
}
int main()
{
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &n);
bt(1);
return 0;
}