Pagini recente » Cod sursa (job #1030411) | Cod sursa (job #2824127) | Cod sursa (job #912356) | Cod sursa (job #300586) | Cod sursa (job #3267601)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("damesah.in");
ofstream g("damesah.out");
int n, x[101];
int valid(int k)
{
for(int i = 1; i < k; i++)
if(x[k] == x[i] || k - i == abs(x[k] - x[i]))
return 0;
return 1;
}
void afis()
{
int i, k;
for(i = 1; i <= n; i++)
g << x[i] << ' ';
}
long long int nrsol;
void backt(int k)
{
if (k <= n)
{
for (int v = 1; v <= n; v++)
{
x[k] = v;
if (valid(k))
backt(k + 1);
}
}
else
{
if(nrsol == 0)
afis();
nrsol++;
}
}
int main()
{
f >> n;
backt(1);
g << '\n' << nrsol;
f.close();
g.close();
return 0;
}