Pagini recente » Cod sursa (job #2703215) | Cod sursa (job #1772484) | Cod sursa (job #2421326) | Cod sursa (job #1847960) | Cod sursa (job #3321551)
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("damesah.in");
ofstream g("damesah.out");
const int NMAX = 13;
int x[NMAX + 1], n, cnt;
bool valid(int k)
{
for (int i = 1; i < k; i++)
if (x[k] == x[i] || 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 = 1;
bool ok = 0;
x[1] = 0;
while (k > 0)
{
if (x[k] < n)
{
x[k]++;
if (valid(k))
{
if (k == n)
{
cnt++;
if (!ok)
{
afis();
ok = 1;
}
}
else
{
k++;
x[k] = 0;
}
}
}
else
k--;
}
}
int main()
{
f >> n;
cnt = 0;
bt();
g << cnt;
f.close();
g.close();
return 0;
}