Pagini recente » Cod sursa (job #854972) | Cod sursa (job #410420) | Cod sursa (job #534097) | Cod sursa (job #242695) | Cod sursa (job #1495002)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("damesah.in");
ofstream fout("damesah.out");
int v[15], n, nr;
bool t[15], md[55], sd[55];
void Afis()
{
nr = 1;
for (int i = 1; i <= n; i++)
fout << v[i] << " ";
fout << "\n";
}
void BK(int k)
{
for (int i = 1; i <= n; i++)
{
v[k] = i;
if (!t[i] && !md[i-k+n-1] && !sd[k+i])
{
t[i] = md[i-k+n-1] = sd[k+i] = true;
if (k == n)
{
nr++;
if (nr == 1)
Afis();
}
else BK(k + 1);
t[i] = md[i-k+n-1] = sd[k+i] = false;
}
}
}
int main()
{
fin >> n;
BK(1);
fout << nr << "\n";
fin.close();
fout.close();
return 0;
}