Pagini recente » Cod sursa (job #2481197) | Cod sursa (job #1403761) | Cod sursa (job #1396767) | Cod sursa (job #2309052) | Cod sursa (job #3321553)
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("damesah.in");
ofstream g("damesah.out");
const int NMAX = 13;
int x[NMAX + 1];
bool fr[NMAX + 1];
int n, cnt;
bool ok;
bool valid(int k)
{
for (int i = 1; i < k; i++)
if (k - i == fabs(x[k] - x[i]))
return 0;
return 1;
}
void afis()
{
for (int i = 1; i <= n; i++)
g << x[i] << ' ';
g << '\n';
}
void bt(int k)
{
if (k <= n)
{
for (int i = 1; i <= n; i++)
if (!fr[i])
{
x[k] = i;
fr[i] = 1;
if (valid(k))
bt(k + 1);
fr[i] = 0;
}
}
else
{
if (!ok)
{
afis();
ok = 1;
}
cnt++;
}
}
int main()
{
f >> n;
/// cnt = 0;
bt(1);
g << cnt;
f.close();
g.close();
return 0;
}