Pagini recente » Cod sursa (job #1923383) | Cod sursa (job #588351) | Cod sursa (job #555267) | Cod sursa (job #1287706) | Cod sursa (job #1657541)
#include <cstdio>
using namespace std;
int n;
int nr = 0;
int nrDame = 0;
int coloana[15];
bool coloanaFolosita[15];
bool diagonalaFolosita1[50];
bool diagonalaFolosita2[50];
void citire()
{
scanf("%d", &n);
}
void afisare()
{
for(int i = 0; i < n; i++)
{
printf("%d ", coloana[i] + 1);
}
printf("\n");
}
void backtrack(int k)
{
if(k == n)
{
if(nr == 0)
{
afisare();
}
nr++;
}
else
{
for(int i = 0; i < n; i++)
{
if(coloanaFolosita[i] == false && diagonalaFolosita1[k + i] == false && diagonalaFolosita2[n - 1 - k + i] == false)
{
coloana[k] = i;
coloanaFolosita[i] = true;
diagonalaFolosita1[k + i] = true;
diagonalaFolosita2[n - 1 - k + i] = true;
backtrack(k + 1);
diagonalaFolosita1[k + i] = false;
diagonalaFolosita2[n - 1 - k + i] = false;
coloana[k] = 0;
coloanaFolosita[i] = false;
}
}
}
}
int main()
{
freopen("damesah.in", "r", stdin);
freopen("damesah.out", "w", stdout);
citire();
backtrack(0);
printf("%d", nr);
return 0;
}