100690: [AtCoder]ABC069 A - K-City

Memory Limit：256 MB Time Limit：2 S
Judge Style：Text Compare Creator：
Submit：0 Solved：0

Description

Score : $100$ points

Problem Statement

In K-city, there are $n$ streets running east-west, and $m$ streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?

Constraints

  • $2 ≤ n, m ≤ 100$

Input

Input is given from Standard Input in the following format:

$n$ $m$

Output

Print the number of blocks in K-city.

Sample Input 1

3 4

Sample Output 1

6

There are six blocks, as shown below:

9179be829dc9810539213537d4c7398c.png

Sample Input 2

2 2

Sample Output 2

1

There are one block, as shown below:

997bfafa99be630b54d037225a5c68ea.png

Input

题意翻译

## 题目描述 在K市，有 $n$ 条东西走向的道路， $m$ 条南北走向的道路。每一条东西向的道路分别与每条南北向的道路相交。我们将由四条道路包围最小的区域称为一个街区( $block$ )。求K市有多少街区？ ## 输入输出格式 ### 输入格式： 输入以如下形式给出 n m ### 输出格式： 输出K城的街区数. ## 样例解释 ### 样例解释一和三 如下图,样例有6个街区 ### 样例解释二和四 如下图,样例有1个街区 由 @Kinandra 提供翻译

Source/Category

加入题单

算法标签：