八皇后递归实现

#include<iostream>
#include<cmath>
using namespace std;
 
const int N = 100;
int x[N] = {-1};
  
bool Success(int k){
	for(int i=0;i<k;i++){
		if(x[i]==x[k] || abs(k-i) == abs(x[i]-x[k])) 
			return false; 
	}
	return true; 
} 
void Print(int n){
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(j==x[i]){  
				cout<<"Q  ";
			}
			else{
				cout<<"0  ";
			}
		}
		cout<<endl;
	}
	cout<<endl; 
} 
void Queue(int n){
	int k=0, num=0;
	while(k>=0)
	{ 
		x[k]++;  
		while(x[k]<n and !Success(k)){
			x[k]++; 
		} 
		if(x[k]<n and k==n-1){
			cout<<"第"<<++num<<"个解是："<<endl;
			Print(n);
		} 
		else if(x[k]<n and k<n-1){
			k++; 
		}else if(x[k]>n-1){

			x[k--] = -1;  
		}
	} 
}
 
 
 
int main()
{
	Queue(8);
	while(1)getchar(); 
	return 0;
}