简单的八皇后问题,水过~~
注意输出格式就可以~~
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cctype>
#include<cstdlib>
#include<algorithm>
using namespace std;
int vis[3][16];
int chess[8][8],maxx;
void Init()
{
maxx = 0;
for(int i = 0;i < 3;i++)
memset(vis[i],0,sizeof(vis[i]));
for(int i = 0;i < 8;i++)
for(int j = 0;j < 8;j++)
scanf("%d",&chess[i][j]);
}
void Search(int cur,int score)
{
int i,j;
if(cur == 8) {if(score > maxx) maxx = score;}
else for(int i = 0;i < 8;i++)
{
if(!vis[0][i] && !vis[1][cur+i] && !vis[2][cur-i+8])
{
vis[0][i] = vis[1][cur+i] = vis[2][cur-i+8] = 1;
Search(cur+1,score + chess[i][cur]);
vis[0][i] = vis[1][cur+i] = vis[2][cur-i+8] = 0;
}
}
}
int main()
{
freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int cases;
scanf("%d",&cases);
while(cases--)
{
Init();
Search(0,0);
printf("%5d\n",maxx);
}
return 0;
}