Pagini recente » Cod sursa (job #1862007) | Cod sursa (job #1530863) | Cod sursa (job #2987889) | Cod sursa (job #2758377) | Cod sursa (job #1443305)
#include <fstream>
using namespace std;
ifstream f("damesah.in");
ofstream g("damesah.out");
int n;
bool Diag1[30], Diag2[30], Coloana[15];
int poz[15];
int nrs;
bool prima = true;
void bkt(int k)
{
int i = 0;
if (k == n+1)
{
if (prima)
{
for (i = 1; i <= n; i++)
g << poz[i] << " ";
g << "\n";
prima = false;
}
nrs++;
}
else
for (i = 1; i <= n; i++)
if (!Coloana[i] && !Diag1[n-k+i] && !Diag2[k+i-1])
{
poz[k] = i;
Coloana[i] = Diag1[n-k+i] = Diag2[k+i-1] = true;
bkt(k+1);
Coloana[i] = Diag1[n-k+i] = Diag2[k+i-1] = false;
}
}
int main()
{
f >> n;
bkt(1);
g << nrs;
return 0;
}