UVa 11538 Chess Queen

Problem A

Chess Queen 

Input: Standard Input

Output: 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 are on same row, column or diagonal of a chess board. Suppose two such chess queens (one black and the other white) are placed on (2x2) chess board. They can be in attacking positions in 12 ways, these are shown in the picture below:

Figure: in a (2x2) chessboard 2 queens can be in attacking position in 12 ways

Given an (NxM) board you will have to decide in how many ways 2 queens can be in attacking position in that.

Input

Input file can contain up to 5000 lines of inputs. Each line contains two non-negative integers which denote the value of M and N (0< M, N£10⁶) respectively.

Input is terminated by a line containing two zeroes. These two zeroes need not be processed.

Output

For each line of input produce one line of output. This line contains an integer which denotes in how many ways two queens can be in attacking position in  an (MxN) board, where the values of M and N came from the input. All output values will fit in 64-bit signed integer.

Sample Input                              Output for Sample Input

2 2 100 223 2300 1000 0 0

12 10907100 11514134000

 

这个题目我感觉比较水，皇后有八个方向可以攻击，分为三种横向的，纵向的，对角的。对于一个 n*m 的棋盘，横纵考虑有 n*(m-1)*m+(n-1)*m*n 方式，对于对角的方向上，有 2 （斜率 1 和 -1 两种情况） *2* （ 1* （ 1-1 ）+2*1+3*2+……..+s*(s-1)*2 ） - 2*(b-s-1)*s*(s-1) 种方式。

 

 

#include<iostream>
#include<algorithm>
#include<cstdio>

using namespace std;

int main(){

    //freopen("input.txt","r",stdin);

    unsigned long long n,m;
    while(cin>>n>>m){
        if(n==0 && m==0)
            break;
        if(n>m)
            swap(n,m);
        cout<<n*m*(n+m-2)+2*n*(n-1)*(3*m-n-1)/3<<endl;
    }
    return 0;
}