Pagini recente » Cod sursa (job #2888895) | Istoria paginii runda/9_2/clasament | Arhiva de probleme | Cod sursa (job #3179767) | Cod sursa (job #1317039)
#include <iostream>
using namespace std;
int sol[1001], n;
/*bool valid(int p)
{
for (int i = 1; i < p; i++)
if (sol[i] == sol[p]) return false;
return true;
}*/
bool folosit[21];
void afisare()
{
for (int i = 1; i <= n; i++)
cout << sol[i] << " ";
cout << "\n";
}
void bkt (int p)
{
if (p - 1 == n) afisare();
else
for (int i = 1; i <= n; i++)
{
/*sol[p] = i;
if (!folosit[p]) bkt(p+1);*/
if (!folosit[i])
{
folosit[i] = true;
sol[p] = i;
bkt(p+1);
folosit[i] = false;
}
}
}
int main()
{
cin >> n;
bkt(1);
return 0;
}