题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2553
基本的DFS,标记数组就是用二维的,放在第i列时, v[0][i] 判断当前第i列有没有用过, v[1][cur + i] 判断副对角线有没有用过,v[2][cur - i + n]判断主对角线, + n是为了防止出现负数造成数组越界.
代码:(dfs函数也写在里面了)
#include <cstdio>
#include <cstring>
int n;
int c[50];
int v[3][50];
int ans;
void dfs(int cur)
{
if(cur == n + 1)
{
ans++;
}
else
for(int i = 1; i <= n; ++i)
{
if(!v[0][i] && !v[1][cur + i] && !v[2][cur - i + n])
{
v[0][i] = v[1][cur + i] = v[2][cur - i + n] = 1;
dfs(cur + 1);
v[0][i] = v[1][cur + i] = v[2][cur - i + n] = 0;
}
}
}
int answer[11] = {0,1,0,0,2,10,4,40,92,352,724};
int main()
{
while(~scanf("%d",&n),n)
{
printf("%d\n",answer[n]);
}
return 0;
}