同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

22197_Diamond

2022-5-16 18:21| 发布者: Hocassian| 查看: 27| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-5-89506192871300-Problem List-采集的数据-后羿采集器.html

Pro.ID

22197

Title

Diamond

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=22197

AC

Submit

Ratio

时间&空间限制

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

描述

Two integers m and n are given. Choose four different points in Cartesian. Coordinate.

The horizontal coordinate of points should be integer in the range [0, m].

The vertical coordinate of points should be integer in the range [0, n].

How many ways of choosing to form a diamond?

输入

A line contains two positive integers m and n. ( m ≤ 1000 and n ≤ 1000 )

Input may contain as many as one million cases. Process to the end of file.

输出

Description

Two integers m and n are given. Choose four different points in Cartesian. Coordinate.

The horizontal coordinate of points should be integer in the range [0, m].

The vertical coordinate of points should be integer in the range [0, n].

How many ways of choosing to form a diamond?

Input

A line contains two positive integers m and n. ( m ≤ 1000 and n ≤ 1000 )

Input may contain as many as one million cases. Process to the end of file.

Output

For each case, output a line contains the calculate result.

Sample Input

2 2

Sample Output

Source

ZS 2008 Ex5

样例输入