K-City

AtCoder

IDabc069_a

Time2000ms

Memory256MB

Difficulty—

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$ [samples]

Samples

Input #1

3 4

Output #1

6

There are six blocks, as shown below:

![image](https://atcoder.jp/img/abc069/9179be829dc9810539213537d4c7398c.png)

Input #2

2 2

Output #2

1

There are one block, as shown below:

![image](https://atcoder.jp/img/abc069/997bfafa99be630b54d037225a5c68ea.png)

API Response (JSON)

{
  "problem": {
    "name": "K-City",
    "description": {
      "content": "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",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc069_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "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...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments