Product Max

AtCoder

IDabc178_b

Time2000ms

Memory256MB

Difficulty—

Given are integers $a,b,c$ and $d$. If $x$ and $y$ are integers and $a \leq x \leq b$ and $c\leq y \leq d$ hold, what is the maximum possible value of $x \times y$? ## Constraints * $-10^9 \leq a \leq b \leq 10^9$ * $-10^9 \leq c \leq d \leq 10^9$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $a$ $b$ $c$ $d$ [samples]

Samples

Input #1

1 2 1 1

Output #1

2

If $x = 1$ and $y = 1$ then $x \times y = 1$. If $x = 2$ and $y = 1$ then $x \times y = 2$. Therefore, the answer is $2$.

Input #2

3 5 -4 -2

Output #2

\-6

The answer can be negative.

Input #3

\-1000000000 0 -1000000000 0

Output #3

1000000000000000000

API Response (JSON)

{
  "problem": {
    "name": "Product Max",
    "description": {
      "content": "Given are integers $a,b,c$ and $d$. If $x$ and $y$ are integers and $a \\leq x \\leq b$ and $c\\leq y \\leq d$ hold, what is the maximum possible value of $x \\times y$?",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc178_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given are integers $a,b,c$ and $d$. If $x$ and $y$ are integers and $a \\leq x \\leq b$ and $c\\leq y \\leq d$ hold, what is the maximum possible value of $x \\times y$?\n\n## Constraints\n\n*   $-10^9 \\leq a ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments