Pagini recente » Cod sursa (job #3039328) | Cod sursa (job #3039175) | Cod sursa (job #2814616) | Cod sursa (job #2065418) | Cod sursa (job #1907197)
#include <fstream>
using namespace std;
ifstream f ("dame.in");
ofstream g ("dame.out");
int c[1003],d1[2003],d2[2003],n,nr,v[1003];;
void back(int k)
{
for(int i=1;i<=n;++i)
{
if(!c[i]&&!d1[i+k]&&!d2[i-k+n+1])
{
v[k]=i;
c[i]=1;
d1[i+k]=1;
d2[i-k+n+1]=1;
if(k==n)
{
++nr;
if(nr==1) for(int j=1;j<=n;++j) g<<j<<' '<<v[j]<<'\n';
}
else if(nr==0) back(k+1);
c[i]=0;
d1[i+k]=0;
d2[i-k+n+1]=0;
}
}
}
int main()
{
f>>n;
g<<n<<'\n';
back(1);
return 0;
}