hdu N皇后问题

#include"iostream"
#include"stdio.h"
#include"string.h"
#include"string"
#include"algorithm"
#include"cmath"
#define mx 105
using namespace std;
int n,Count;
int maze[mx];
int vis[mx];
int solve[mx];
void dfs(int k)
{
    int i,j,flag;
    if(k==n+1)
    {
        Count++;
        return;
    }
    for(i=1;i<=n;i++)
    {
        if(!vis[i])
        {
            maze[k]=i;
            flag=1;
            for(j=1;j<=k-1;j++)//判断是否在同一个斜线上
            {
                if(abs(k-j)==abs(maze[k]-maze[j]))
                {
                    flag=0;break;
                }
            }
                if(flag)
                {
                    vis[i]=1;
                    dfs(k+1);
                    vis[i]=0;
                }

        }
    }
}
int main()
{
    for(int i=1;i<=10;i++)
    {
        Count=0;
        memset(vis,0,sizeof(vis));
        memset(maze,0,sizeof(maze));
        n=i;
        dfs(1);
        solve[i]=Count;
    }

    while(cin>>n,n)
    {
        cout<<solve[n]<<endl;
    }
    return 0;
}