Pagini recente » Cod sursa (job #1934208) | Cod sursa (job #673101) | Cod sursa (job #560696) | Cod sursa (job #242075) | Cod sursa (job #3238886)
#include<fstream>
using namespace std;
ifstream F("damesah.in");
ofstream G("damesah.out");
int n,m,d[13];
bool a[13],b[26],c[26];
void A(int k)
{
int i;
if(k==n) {
if(++m==1)
for(i=0;i<k;G<<1+d[i++]<<' ');
} else
for(i=0;i<n;++i)
if(a[i]+b[i+k]+c[n-1+i-k]==0)
d[k]=i,a[i]=b[i+k]=c[n-1+i-k]=1,A(k+1),a[i]=b[i+k]=c[n-1+i-k]=0;
}
int main()
{
return F>>n,A(0),G<<'\n'<<m,0;
}