n 皇后，试探法。新手

#include<stdio.h>
#include <math.h>
bool check(int * Queen,int n)
{
int i;
for(i=0;i<n;++i)
{
if(Queen[i]==Queen[n]||abs(Queen[i]-Queen[n])==n-i)return 0;
}
return 1;
}
void show(int * Queen,int Max)
{
for(int i=0;i<Max;++i)
{
printf("(%d , %d)",i,Queen[i]);
}
}
void Put(int * Queen,int Max,int n)
{
int i;
for(i=0;i<Max;++i)
{
Queen[n]=i;
if(check(Queen,n))
{
if(n==Max-1)show(Queen,Max);
else Put(Queen,Max,n+1);
}
}
}
int main()
{
int num=0;
scanf("%d",&num);
int *Queen=new int [num];
Put(Queen,num,0);
}