9 10 11 12 13 14 15 16
17 18 19 20 21 22 23 24
25 26 27 28 29 30 31 32
33 34 35 36 37 38 39 40
41 42 43 44 45 46 47 48
48 50 51 52 53 54 55 56
57 58 59 60 61 62 63 64
#include <stdio.h>
#include <iostream>
using namespace std;
int ba[8][8]={0};
int content[8][8];
//int count = 0;
int resultMax = 0;
void judge(){
int i,j;
int sum = 0;
for ( i = 0; i < 8; ++i)
{
for ( j = 0; j < 8; ++j)
{
if (ba[i][j] == 1)
{
sum += content[i][j];
}
}
}
// printf("%d",sum);
if (sum > resultMax)
{
resultMax=sum;
}
}
int check(int row ,int column){
int i,j;
if (row == 0)//第一行//第一個皇后//隨便放
{
return 1;
}
for ( i = 0; i < row; ++i)
{//上方 //下方就沒必要了
if (ba[i][column] == 1)
{
return 0;
}
}
for ( i = 0; i < column; ++i)
{//左方
if (ba[row][i] == 1)
{
return 0;
}
}
i=row-1;
j=column-1;
while(i>=0 && j>=0)
{//左上
if (ba[i][j] == 1)
{
return 0;
}
i--;
j--;
}
//右上
i=row-1;
j=column+1;
while(i>=0 && j<8)
{
if (ba[i][j] == 1)
{
return 0;
}
i--;
j++;
}
return 1;
}
/*
void print()
{
int i,j;
printf("%d\n", count);
for ( i = 0; i < 8; ++i)
{
for ( j = 0; j < 8; ++j)
{
printf("%d ", ba[i][j]);
}
printf("\n");
}
printf("\n");
}
*/
void solve(int row){
int column ;
for (column = 0; column < 8; ++column)
{//考慮在某行放皇后
//在某一列放皇后
ba[row][column]=1;
if (check(row,column))//檢測該列是否可放
{//該列可放皇后
if (row==7)
{//已放完最後一個一個皇后,輸出
//count++;
judge();
/*
print();
*/
}else{//還沒放完皇后,繼續下一行
solve(row + 1);
}
}
//回溯
ba[row][column]=0;
}
}
int main(int argc, char const *argv[])
{//
int i,j;
for ( i = 0; i < 8; ++i)
{
for ( j = 0; j < 8; ++j)
{
cin >> content[i][j];
}
}
solve(0);
printf("%d\n", resultMax);
return 0;
}