Pagini recente » Statistici Miron Claudiu Danut (MCDanut) | Istoria paginii utilizator/meeroo | Atasamentele paginii Profil xxxy | Istoria paginii utilizator/altair | Cod sursa (job #2013721)
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
ifstream in("damesah.in");
ofstream out("damesah.out");
vector<int> solutii;
vector<int> first_one;
vector<bool> col(14,false);
vector<bool> diag1(28,false);
vector<bool> diag2(28,false);
bool checked = false;
int count = 0;
int n;
bool verif(int i, int y)
{
if(col[i])
return false;
if(diag1[i+y])
return false;
if(diag2[i+n-y-1])
return false;
return true;
}
void search(int y)
{
if(y == n)
{
if(checked == false)
{
first_one = solutii;
checked = true;
}
count++;
}
for(int i = 0; i < n; i++ )
{
if(!verif(i,y))
continue;
solutii.push_back(i);
col[i] = diag1[i+y] = diag2[i+n-y-1] = true;
search(y+1);
col[i] = diag1[i+y] = diag2[i+n-y-1] = false;
solutii.pop_back();
}
}
int main()
{
in >> n;
search(0);
for(auto var : first_one)
out << var + 1 << ' ';
out << '\n';
out << count;
return 0;
}