Pagini recente » Cod sursa (job #2639089) | Cod sursa (job #3242742) | Cod sursa (job #283720) | Cod sursa (job #3229277) | Cod sursa (job #2375310)
#include <bits/stdc++.h>
#define MAX_N 14
using namespace std;
int queen[MAX_N];
bool col[MAX_N], main_diag[MAX_N * 2], sec_diag[MAX_N * 2];
int ans;
ifstream fin ("damesah.in"); ofstream fout ("damesah.out");
void bkt( int l, int n )
{
if ( l == n )
{
if ( ans < 1 )
{
for ( int c = 0; c < n; c++ )
fout << queen[c] + 1 << ' ';
fout << '\n';
}
++ans;
} else
{
for ( int c = 0; c < n; c++ )
{
if ( !col[c] && !main_diag[c - l + n - 1] && !sec_diag[l + c] )
{
queen[l] = c;
col[c] = main_diag[c - l + n - 1] = sec_diag[l + c] = true;
bkt(l + 1, n );
col[c] = main_diag[c - l + n - 1] = sec_diag[l + c] = false;
}
}
}
}
int main ()
{
int n;
fin >> n;
bkt(0, n );
fout << ans;
fin.close(); fout.close();
return 0;
}