Pagini recente » Cod sursa (job #1391368) | Cod sursa (job #872862) | Cod sursa (job #899604) | Cod sursa (job #2196513) | Cod sursa (job #1408908)
#include<fstream>
#include<cmath>
using namespace std;
int a[50],n,i,k,v;
int valid(int k)
{
int i;
for(i=1;i<k;i++)
if(a[i]==a[k]||fabs(a[i]-a[k])==fabs(k-i))
return 0;
return 1;
}
int main()
{
ifstream f("damesah.in");
ofstream g("damesah.out");
f>>n;
i=1;
do{
do
{
a[i]++;
if(a[i]>n)
{
a[i]=0;
i--;
}
else
if(valid(i))
i++;
}while(i<=n&&i>0);
if(i>n)
{
if(v==0)
for(i=1;i<=n;i++)
g<<a[i]<<" ";
i=n;
g<<"\n";
v=1;
}
}while(i>0);
return 0;
}