Pagini recente » Cod sursa (job #1965433) | Cod sursa (job #2764382) | Cod sursa (job #2038504) | Cod sursa (job #2842638) | Cod sursa (job #2180919)
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("damesah.in");
ofstream g("damesah.out");
int n, x[14], nrsol = 0, ok = 0;
int col[14], dg1[26], dg2[26];
bool valid(int k)
{
if((col[x[k]] == 0) && (dg1[k + x[k] - 1] == 0) && (dg2[n - k + x[k]] == 0)) //valid
{
col[x[k]] = dg1[k + x[k] - 1] = dg2[n - k + x[k]] = 1;
return 1;
}
return 0;
}
void bt(int k)
{
if(k <= n)
for(int i = 1; i <= n; i++)
{
x[k] = i;
if(valid(k) == 1)
{
bt(k + 1);
col[x[k]] = dg1[k + x[k] - 1] = dg2[n - k + x[k]] = 0;
}
}
else
{
if(ok == 0)
{
for(int i = 1; i <= n; i++)
g << x[i] << ' ';
g << '\n';
ok = 1;
}
nrsol++;
}
}
int main()
{
f >> n;
bt(1);
g << nrsol;
return 0;
}