UVA_11538
可以将两个皇后的位置分为横、竖、斜三种情况去计算，每种都可以总结出O(1)的计算公式。
#include<stdio.h>
#include<string.h>
#include<algorithm>
typedef long long LL;
int N, M;
LL sum(int n)
{
return (LL) n
Problem AChess Queen Input: Standard InputOutput: Standard Output You probably know how the game of chess is played and how chess queen operates. Two chess queens are in attacking position when they a
Chess QueenYou probably know how the game of chess is played and how chess queen operates. Two chess queens are in attacking position when they are on same row, column or diagonal of a chess board
