Pagini recente » Cod sursa (job #3030248) | Cod sursa (job #2594781) | Cod sursa (job #1581402) | Cod sursa (job #619083) | Cod sursa (job #3162875)
#include <iostream>
#include <math.h>
#include<fstream>
using namespace std;
ifstream fin("damesah.in");
ofstream fout("damesah.out");
int x[13];
int solutie[13];
void tiparesteSolutie(int n)
{
for (int i = 1; i <= n; i++)
{
solutie[i] = x[i];
}
}
bool eValid(int k)
{
for (int i = 1; i < k; i++)
if ((x[k] == x[i]) || (k - i == abs(x[k] - x[i])))
{
return false;
}
return true;
}
int backtrack(int n)
{
int eSolutie, k;
k = 1;
x[k] = 0;
int nrSolutii = 0;
int prima = 1;
while (k > 0)
{
eSolutie = 0;
while ((x[k] < n) && (!eSolutie))
{
x[k]++;
eSolutie = eValid(k);
}
if (!eSolutie){
k--;
}
else
{
if (k == n)
{
if (prima)
{
tiparesteSolutie(n);
prima = 0;
}
nrSolutii++;
}
else
{
k++;
x[k] = 0;
}
}
}
return nrSolutii;
}
int main()
{
int n, k, eSolutie;
fin >> n;
int nrSolutii = backtrack(n);
for (int i = 1; i <= n; i++)
{
fout << solutie[i] << " ";
}
fout << '\n';
fout << nrSolutii;
return 0;
}