Pagini recente » Cod sursa (job #1533263) | Cod sursa (job #83595) | Cod sursa (job #2289178) | Cod sursa (job #2753983) | Cod sursa (job #2851418)
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("damesah.in");
ofstream g("damesah.out");
int n, x[101], nrsol = 0;
bool ok = 0;
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()
{
for(int i = 1; i <= n; i++)
g << x[i] << ' ';
g << '\n';
}
void backt(int k)
{
if(k <= n)
for(int v = 1; v <= n; v++)
{
x[k] = v;
if(valid(k)) ///v.c.c.
backt(k + 1); //avansare
}
else
{
if(ok == 0)
{
afis();
ok = 1;
}
nrsol++;
}
}
int main()
{
f >> n;
backt(1);
g << nrsol ;
return 0;
}