Pagini recente » Cod sursa (job #613783) | Cod sursa (job #188953) | Cod sursa (job #2478993) | Cod sursa (job #100475) | Cod sursa (job #2478354)
#include<bits/stdc++.h>
using namespace std;
ifstream f("damesah.in");
ofstream g("damesah.out");
int n, NumberOfSolutions;
vector <int> sol(15), viz(15);
void ShowSolution()
{
for (int i = 1; i <= n; i++)
g << sol[i] << " ";
g << "\n";
}
void back_dame(int k)
{
if (k == n + 1)
{
++NumberOfSolutions;
if (NumberOfSolutions == 1)
ShowSolution();
return;
}
for (int i = 1; i <= n; i++)
{
if (viz[i] == 0)
{
viz[i] = 1;
sol[k] = i;
int ok = 1;
for (int j = 1; j < k; j++)
{
int v1 = sol[k] - sol[j];
int v2 = sol[j] - sol[k];
if ((sol[k] - sol[j] == k - j) || (sol[j] - sol[k] == k - j))
{
ok = 0;
break;
}
}
if (ok == 1)
back_dame(k + 1);
viz[i] = 0;
}
}
}
int main()
{
f >> n;
back_dame(1);
g << NumberOfSolutions;
return 0;
}