Pagini recente » Cod sursa (job #1095629) | Cod sursa (job #815254) | Cod sursa (job #1494998)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("damesah.in");
ofstream fout("damesah.out");
int v[15], n, nr;
int 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;
t[i]++;
md[i-k+n-1]++;
sd[k+i]++;
if (t[i] == 1 && md[i-k+n-1] == 1 && sd[k+i] == 1)
{
if (k == n)
{
if (nr == 0)
Afis();
else nr++;
}
else BK(k + 1);
}
md[i-k+n-1]--;
sd[k+i]--;
t[i]--;
}
}
int main()
{
fin >> n;
BK(1);
fout << nr << "\n";
fin.close();
fout.close();
return 0;
}