Curtain

AtCoder

IDabc143_a

Time2000ms

Memory256MB

Difficulty—

The window of Takahashi's room has a width of $A$. There are two curtains hung over the window, each of which has a horizontal length of $B$. (Vertically, the curtains are long enough to cover the whole window.) We will close the window so as to minimize the total horizontal length of the uncovered part of the window. Find the total horizontal length of the uncovered parts of the window then. ## Constraints * $1 \leq A \leq 100$ * $1 \leq B \leq 100$ * $A$ and $B$ are integers. ## Input Input is given from Standard Input in the following format: $A$ $B$ [samples]

Samples

Input #1

12 4

Output #1

4

We have a window with a horizontal length of $12$, and two curtains, each of length $4$, that cover both ends of the window, for example. The uncovered part has a horizontal length of $4$.

Input #2

20 15

Output #2

0

If the window is completely covered, print $0$.

Input #3

20 30

Output #3

0

Each curtain may be longer than the window.

API Response (JSON)

{
  "problem": {
    "name": "Curtain",
    "description": {
      "content": "The window of Takahashi's room has a width of $A$. There are two curtains hung over the window, each of which has a horizontal length of $B$. (Vertically, the curtains are long enough to cover the who",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc143_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "The window of Takahashi's room has a width of $A$. There are two curtains hung over the window, each of which has a horizontal length of $B$. (Vertically, the curtains are long enough to cover the who...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments