Pagini recente » Cod sursa (job #708748) | Cod sursa (job #3202587) | Cod sursa (job #2989625) | Cod sursa (job #2330427) | Cod sursa (job #183207)
Cod sursa(job #183207)
#include<fstream.h>
#include<math.h>
int k,s[1010],ok=1,cont=1,i,n;
int main()
{
ifstream f("dame.in");
ofstream g("dame.out");
f>>n;
if(n==1||n==2) g<<"1"<<'\n'<<"1 1";
else if(n==3) g<<"2"<<'\n'<<"1 1"<<'\n'<<"2 3";
else
{
k=1; s[k]=0;
while(k>0)
if(s[k]<n)
{s[k]++; cont=1;
for(i=1;i<k;i++)
if(s[k]==s[i]||abs(s[k]-s[i])==abs(k-i))
{cont=0;break;}
if(cont)
{if(k==n)
{ g<<n<<'\n';
for(i=1;i<=n;i++)
g<<i<<" "<<s[i]<<'\n';
break;
}
else { k++; s[k]=0;}
}
}
else k--;
}
f.close();
g.close();
return 0;
}