spoj 1771 Yet Another N-Queen Problem

 https://www.spoj.pl/problems/NQUEEN/

精确覆盖，每个格子为行，行、列、两条对角线为列 所以矩阵大小为 n*n*(6*n-2)，dfs的时候当深度大于n就可以退出了

# include <math.h>
# include <stdio.h>
# include <string.h>
# include <stdlib.h>
# include <algorithm>
# include <iostream>
# include <string>
# include <queue>
# include <stack>
# include <map>
# include <set>
# include <vector>
# include <cstring>
# include <list>
# include <ctime>

# define For(i,a)   for((i)=0;i<(a);(i)++)
# define MAX(x,y)   ((x)>(y)? (x):(y))
# define MIN(x,y)   ((x)<(y)? (x):(y))
# define MEM(a)     (memset((a),0,sizeof(a)))
# define MEME(a)    (memset((a),-1,sizeof(a)))
# define MEMX(a)    (mem