UVa 11538 Chess Queen:组合&分类

UVa 11538 Chess Queen:组合&分类2014-10-02 csdn博客 synapse7

11538 - Chess Queen

Time limit: 2.000 seconds

http://uva.onlinejudge.org/index.php？option=com_onlinejudge&Itemid=8&category=469&page=show_problem&problem=2533

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, N106） respectively.

本文URL地址：http://www.bianceng.cn/Programming/sjjg/201410/45375.htm

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

《训练指南》P106上的题。

考虑横竖斜三种情况：前两种分别是nm（m-1）和nm（n-1），后一种要考虑所有对角线的长度。

完整代码：

/*0.019s*/#include<cstdio>#include<algorithm>using namespace std;int main（）{long long n, m;while （scanf（"%lld%lld", &n, &m）, n）{if （n > m） swap（n, m）;printf（"%lld
", n * m * （m + n - 2） + 2 * n * （n - 1） * （3 * m - n - 1） / 3）;}return 0;}