Pagini recente » Cod sursa (job #910884) | Cod sursa (job #2520604) | Cod sursa (job #2447231) | Cod sursa (job #2698351) | Cod sursa (job #2209788)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("damesah.in");
ofstream g("damesah.out");
int n, x[14], nrsol;
bool col[14], dg1[26], dg2[26];
void afis()
{
nrsol++;
if(nrsol == 1)
{
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++)
{
x[k] = i;
if(col[i] == 0 && dg1[k + i - 1] == 0 && dg2[n - k + i] == 0) //valid
{
col[i] = dg1[k + i - 1] = dg2[n - k + i] = 1;
BT(k + 1);
col[i] = dg1[k + i - 1] = dg2[n - k + i] = 0;
}
}
else
afis();
}
int main()
{
f >> n;
BT(1);
g << nrsol;
return 0;
}