Pagini recente » Cod sursa (job #601243) | Borderou de evaluare (job #1008069) | Cod sursa (job #2730587) | Borderou de evaluare (job #960082) | Cod sursa (job #3163811)
#include <fstream>
using namespace std;
ifstream fin ("damesah.in");
ofstream fout("damesah.out");
int n;
int x[30],f[30];
int sol;
bool found;
int verif(int pas)
{
for(int i=1;i<pas;i++)
if(pas-i==abs(x[pas]-x[i]))
return 0;
return 1;
}
void backtrack(int pas)
{
if(pas==n+1)
{
if(!found)
{
for(int i=1;i<=n;i++)
fout<<x[i]<<" ";
fout<<'\n';
}
sol++;
found=1;
}
else
for(int i=1;i<=n;i++)
if(f[i]==0)
{
x[pas]=i;
f[i]=1;
if(verif(pas))
backtrack(pas+1);
f[i]=0;
}
}
int main()
{
fin>>n;
backtrack(1);
fout<<sol;
return 0;
}