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 ofM andN (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 ofM andN 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

 

 

Problemsetter: Shahriar Manzoor

Special Thanks to: Mohammad Mahmudur Rahman

 

题意：如果棋盘是n*m的，有多少种方法设置两个互相攻击的皇后。

一共有三种情况在同一行，同一列，同一对角线。同一行和同一列都比较好计算是n*m*(m-1)和m*n*(n-1)种。同一对角线需要推理（推理略），最后推出的结果是2*n*(n-1)*(3*m-n-1)/3种。然后把这三种情况加起来即可。注意要用long long型。

 

#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
    long long n,m;
    while(scanf("%lld%lld",&n,&m),n|m)
    {
        if(n>m)swap(n,m);
        long long ans=n*m*(m+n-2)+2*n*(n-1)*(3*m-n-1)/3;
        printf("%lld\n",ans);
    }
    return 0;
}