uva11538 Chess Queen

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 (2 2) chess
board. They can be in attacking positions in 12 ways, these are shown
in the picture below: Figure: in a (2 2) chessboard 2 queens can be
in attacking position in 12 ways Given an ( N M ) board you will
have to decide in how many ways 2 queens can be in attacking position
in that. Input Input le 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 6 ) 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 ( M N ) board, where the values of M and N
came from the input. All output values will t in 64-bit signed
integer.

只需要考虑同行、同列、同对角线的情况然后相加。
不妨设n<=m。
同行情况，先选择某一行（$n$），然后在这一行中选两个元素（$m(m-1)$），答案是$mn(m-1)$。
同列类似。
同对角线，对角线的长度可以看成两个1..n再加上m-n+1个n。后者答案是$(m-n-1)n(n-1)$，前者答案是

$$\sum_{i=0}^n i(i-1) = \frac{n(n+1)(2n+1)}{6}-\frac{n(n+1)}{2}=\frac{n^3-n}{3}$$
不要忘记有两个方向的对角线。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
#define LL long long
int main()
{
    LL m,n;
    while (cin>>n>>m&&n)
    {
        if (n>m) swap(m,n);
        cout<<m*n*(m+n-2)+4*(n*n*n-n)/3+2*(m-n-1)*n*(n-1)<<endl;
    }
}