UVA 11538 Chess Queen

作者: Tonioi 分类: 算法与数据结构 发布时间: 2014-10-25 02:28 阅读: 1,692

 中文详解请访问我的博客:http://xiaoshig.sinaapp.com/?p=126

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:

 

UVA 11538 Chess Queen


Figure: in a (2×2) 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£106) 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

This article is automatically posted by WP-AutoPost : WordPress自动采集发布插件
HTML标签过滤,WP-AutoPost

如果觉得我的文章对您有用,请随意打赏。您的支持将鼓励我继续创作!

发表评论

电子邮件地址不会被公开。 必填项已用*标注