Pagini recente » Cod sursa (job #396501) | Cod sursa (job #403617) | Cod sursa (job #1093871) | Cod sursa (job #2145835) | Cod sursa (job #2030437)
#include<iostream>
#include<fstream>
#include <stdlib.h>
using namespace std;
void PQueen(int,int);
int verifyP(int,int);
void show();
ifstream in("damesah.in");
ofstream out("damesah.out");
int n,col[14],nr = 0;
bool first = true;
int main()
{
in>>n;
PQueen(1,1);
out<<"\n"<<nr;
}
void PQueen(int r, int column)
{
for(int i = 1;i <= n;i++)
{
if(verifyP(r,i))
{
col[r] = i;
if(r == n)
{
nr++;
show();
}
else
{
PQueen(r + 1,column);
}
}
}
}
int verifyP(int r, int collumn)
{
for(int i = 1; i < r; i++)
{
if(col[i] == collumn || abs(col[i] - collumn) == abs(i - r))
{
return 0;
}
}
return 1;
}
void show()
{
if(first == true)
{
for(int i = 1; i <= n; i++)
{
out<<col[i]<<" ";
}
}
first = false;
}