简单的八皇后问题---NOJ1593

if(a[i] == a[j] || abs(a[j]-a[i])==abs(j-i))

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
using namespace std;
int t, a[8], kase = 0;
char s[8][9];

int main(int argc, char const *argv[])
{

scanf("%d", &t);
while(t--)
{
int ok =1;
for(int i = 0; i < 8; i++)
scanf("%s", s[i]);
for(int i = 0; i < 8; i++)
{
for(int j = 0; j < 8; j++)
if(s[i][j] == 'Q')
a[i] = j;

}
if(!ok)
printf("Case %d: Yes\n", ++kase);
else
{
for(int i = 0; i < 8; i++)
for(int j = 0; j < i; j++)
if(a[i] == a[j] || abs(a[j]-a[i])==abs(j-i))
{ ok = 0;  break; }
if(ok)
printf("Case %d: No\n", ++kase);
else
printf("Case %d: Yes\n", ++kase);
}
}
return 0;
}