Pagini recente » Cod sursa (job #2978176) | Cod sursa (job #701725) | Cod sursa (job #804121) | Cod sursa (job #293454) | Cod sursa (job #2853965)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("damesah.in");
ofstream fout("damesah.out");
int n, cnt, x[14];
bool C[14], dP[26], dS[26];
void afisare(int n, int sol[])
{
for(int i = 1; i <= n; i++)
fout << sol[i] << ' ';
fout << '\n';
}
void back(int k)
{
if(k <= n)
{
for(int i = 1; i <= n; i++)
if(C[i] == 0 && dP[n - k + i] == 0 && dS[k + i - 1] == 0)
{
x[k] = i;
C[i] = dP[n - k + i] = dS[k + i - 1] = 1;
back(k + 1);
C[i] = dP[n - k + i] = dS[k + i - 1] = 0;
}
}
else
{
if(cnt == 0)
afisare(n, x);
cnt++;
}
}
int main()
{
fin >> n;
back(1);
fout << cnt;
return 0;
}