Pagini recente » Cod sursa (job #2306412) | Cod sursa (job #3204973) | Cod sursa (job #1667511) | Cod sursa (job #2463152) | Cod sursa (job #1651816)
#include <cstdio>
using namespace std;
int v[9], n;
void write()
{
for (int i = 1; i <= n; ++i)
printf("%d ", v[i]);
printf("\n");
}
bool OK(int k)
{
for (int i = 1; i <= k - 1; ++i)
if (v[i] == v[k]) return false;
return true;
}
void gen(int k)
{
if (k > n) write();
else{
for (int i = 1; i <= n; ++i){
v[k] = i;
if (OK(k)) gen(k + 1);
}
}
}
int main()
{
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &n);
gen(1);
return 0;
}