Divide a Cuboid

AtCoder

IDagc004_a

Time2000ms

Memory256MB

Difficulty—

We have a rectangular parallelepiped of size $A×B×C$, built with blocks of size $1×1×1$. Snuke will paint each of the $A×B×C$ blocks either red or blue, so that: * There is at least one red block and at least one blue block. * The union of all red blocks forms a rectangular parallelepiped. * The union of all blue blocks forms a rectangular parallelepiped. Snuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference. ## Constraints * $2≤A,B,C≤10^9$ ## Input The input is given from Standard Input in the following format: $A$ $B$ $C$ [samples]

Samples

Input #1

3 3 3

Output #1

9

For example, Snuke can paint the blocks as shown in the diagram below. There are $9$ red blocks and $18$ blue blocks, thus the difference is $9$.
![image](/img/agc/004/gatbantar/A_1.png)

Input #2

2 2 4

Output #2

0

For example, Snuke can paint the blocks as shown in the diagram below. There are $8$ red blocks and $8$ blue blocks, thus the difference is $0$.
![image](/img/agc/004/gatbantar/A_2.png)

Input #3

5 3 5

Output #3

15

For example, Snuke can paint the blocks as shown in the diagram below. There are $45$ red blocks and $30$ blue blocks, thus the difference is $9$.
![image](/img/agc/004/gatbantar/A_3.png)

API Response (JSON)

{
  "problem": {
    "name": "Divide a Cuboid",
    "description": {
      "content": "We have a rectangular parallelepiped of size $A×B×C$, built with blocks of size $1×1×1$. Snuke will paint each of the $A×B×C$ blocks either red or blue, so that: *   There is at least one red block a",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "agc004_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "We have a rectangular parallelepiped of size $A×B×C$, built with blocks of size $1×1×1$. Snuke will paint each of the $A×B×C$ blocks either red or blue, so that:\n\n*   There is at least one red block a...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments