Serval vs Monster

AtCoder

IDabc153_a

Time2000ms

Memory256MB

Difficulty—

Serval is fighting with a monster. The _health_ of the monster is $H$. In one attack, Serval can decrease the monster's health by $A$. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes $0$ or below. Find the number of attacks Serval needs to make before winning. ## Constraints * $1 \leq H \leq 10^4$ * $1 \leq A \leq 10^4$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $H$ $A$ [samples]

Samples

Input #1

10 4

Output #1

3

*   After one attack, the monster's health will be $6$.
*   After two attacks, the monster's health will be $2$.
*   After three attacks, the monster's health will be $-2$.

Thus, Serval needs to make three attacks to win.

Input #2

1 10000

Output #2

Input #3

10000 1

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Serval vs Monster",
    "description": {
      "content": "Serval is fighting with a monster. The _health_ of the monster is $H$. In one attack, Serval can decrease the monster's health by $A$. There is no other way to decrease the monster's health. Serval wi",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc153_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Serval is fighting with a monster.\nThe _health_ of the monster is $H$.\nIn one attack, Serval can decrease the monster's health by $A$. There is no other way to decrease the monster's health.\nServal wi...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments