Pagini recente » Cod sursa (job #141056) | Cod sursa (job #180967) | Cod sursa (job #1076721) | Cod sursa (job #3221040) | Cod sursa (job #1584848)
#include <iostream>
#include <cstdio>
using namespace std;
int n;
bool folosite[10];
int solutie[10];
void afiseaza()
{
for(int i = 0; i < n; i++)
{
printf("%d ", solutie[i]);
}
printf("\n");
}
void backtrack(int k)
{
if(k == n)
{
afiseaza();
}
else
{
for(int i = 0; i < n; i++)
{
if(folosite[i] == false)
{
folosite[i] = true;
solutie[k] = i + 1;
backtrack(k + 1);
folosite[i] = false;
}
}
}
}
int main()
{
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &n);
backtrack(0);
return 0;
}