requeen.cpp

常用算法与数据结构原代码

#include <iostream.h>
#include <fstream.h>
#define MAX 20
int n,col[MAX+1],a[MAX+1],b[2*MAX+1],c[2*MAX+1];
ofstream out("a.txt");

void queen(int k,int n)
{
	int i,j;
	for (i=1;i<=n;i++)
		if (a[i] && b[k+i] && c[n+k-i])
		{
			col[k]=i;
			a[i]=b[k+i]=c[n+k-i]=0;
			if (k==n)
			{
				for (j=1;j<=n;j++)
					out<<"列"<<j<<" 行"<<col[j]<<endl;
				out<<endl;
			}
			else
				queen(k+1,n);
			a[i]=b[k+i]=c[n+k-i]=1;
		}
}

void main()
{
	int j;
	cin>>n;
	for (j=0;j<=n;j++)
		a[j]=1;
	for (j=0;j<=2*n;j++)
		b[j]=c[j]=1;
	queen(1,n);
	out.close();
}