Pagini recente » Clasamentul arhivei de probleme | Cod sursa (job #1401135) | Cod sursa (job #88133) | Cod sursa (job #2805504) | Cod sursa (job #2183503)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("damesah.in");
ofstream g("damesah.out");
int n,x[15],nr;
int valid(int k)
{
for(int i = 1; i < k; i++)
if(x[k] == x[i] || k - i == abs(x[k] - x[i]))
return 0;
return 1;
}
void afis()
{
for(int i = 1; i <= n; i++)
g << x[i] << ' ';
g << endl;
}
void backt(int k)
{
for(int i = 1; i <= n; i++)
{
x[k] = i;
if(valid(k))
{
if(k == n) {
if(nr==0)afis();
nr++;
}
else
backt(k + 1);
}
}
}
int main()
{f>>n;
backt(1);
g<<nr;
return 0;
}