Pagini recente » Cod sursa (job #2984700) | Cod sursa (job #1296796) | Cod sursa (job #224516) | Cod sursa (job #2697107) | Cod sursa (job #1408800)
#include<fstream>
#include<cmath>
using namespace std;
int x[50],i,n,k,j,ok=0,nr;
ifstream f("damesah.in");
ofstream g("damesah.out");
int valid(int k)
{
int i;
for(i=1;i<k;i++)
if(x[i]==x[k] || fabs(x[i]-x[k])==fabs(k-i))
return 0;
return 1;
}
int main()
{
f>>n;
i=1;
do
{
do
{
x[i]++;
if(x[i]>n)
{
x[i]=0;
i--;
}
else
if(valid(i))
i++;
}while(i<=n && i>0);
if(i>n)
{
if(ok==0)
{
for(j=1;j<=n;j++)
g<<x[j]<<" ";
ok=1;
}
i=n;nr++;
}
}while(i>0);
g<<"\n";
g<<nr;
return 0;
}