Pagini recente » Cod sursa (job #3258193) | Cod sursa (job #943310) | Cod sursa (job #1004754) | Cod sursa (job #1433362) | Cod sursa (job #1644243)
#include <fstream>
using namespace std;
ifstream f("damesah.in");
ofstream g("damesah.out");
short n;
int nr;
int sol[20];
bool diag1[20], diag2[20], lin[20];
void bkt(int k)
{
int i;
if (k == n+1)
{
if (nr == 0)
for (i = 1; i <= n; i++)
g << sol[i] << " ";
nr++;
}
else
{
for (i = 1; i <= n; i++)
if (diag1[n-k+i] == 0 && diag2[k+i-1] == 0 && lin[i] == 0)
{
diag1[n-k+i] = diag2[k+i-1] = lin[i] = 1;
sol[k] = i;
bkt(k+1);
diag1[n-k+i] = diag2[k+i-1] = lin[i] = 0;
}
}
}
int main()
{
f >> n;
bkt(1);
g << "\n" << nr;
return 0;
}