Pagini recente » Borderou de evaluare (job #2983392) | Rezultatele filtrării | Borderou de evaluare (job #2434971) | Rezultatele filtrării | Cod sursa (job #1117420)
#include <fstream>
using namespace std;
ifstream fin("damesah.in");
ofstream fout("damesah.out");
bool diag1[30], diag2[30], line[14], written;
int x[14], n;
unsigned long long sol;
void Back(int k)
{
if(k==n+1)
{
sol++;
if(!written)
{
for(int i = 1; i<= n; i++ )
fout<<x[i]<<' ';
fout<<'\n';
written=true;
}
return;
}
for(int i = 1; i<= n; i++ )
{
if(!diag1[n+k-i+1]&&!diag2[i+k-1]&&!line[i])
{
diag1[n+k-i+1]=true;
diag2[i+k-1]=true;
line[i]=true;
x[k]=i;
Back(k+1);
diag1[n+k-i+1]=false;
diag2[i+k-1]=false;
line[i]=false;
}
}
}
int main()
{
fin>>n;
Back(1);
fout<<sol;
fin.close();
fout.close();
return 0;
}