Balloon Trip

AtCoder

IDabc434_a

Time2000ms

Memory256MB

Difficulty—

Given integers $W$ and $B$, solve the following problem. Takahashi's weight is $W {\rm [kg]}$. (Note that the unit is ${\rm kg}$.) An object attached with $n$ balloons will fly into the sky if and only if the mass of the object is **strictly less than** $nB$ ${\rm [g]}$. What is the minimum number of balloons needed to make Takahashi fly into the sky? ## Constraints * $1 \le W \le 100$ * $1 \le B \le 100$ * All input values are integers. ## Input The input is given from Standard Input in the following format: $W$ $B$ [samples]

Samples

Input #1

80 5

Output #1

16001

Takahashi's weight is $80$ ${\rm kg}$ $=$ $80000$ ${\rm g}$.  
If he is attached with $16001$ balloons, his mass is less than $16001 \times 5=80005$ ${\rm g}$, so he will fly into the sky.  
Note that $16000$ balloons are not sufficient.

Input #2

70 6

Output #2

Input #3

100 100

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Balloon Trip",
    "description": {
      "content": "Given integers $W$ and $B$, solve the following problem. Takahashi's weight is $W {\\rm [kg]}$. (Note that the unit is ${\\rm kg}$.)   An object attached with $n$ balloons will fly into the sky if and o",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc434_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given integers $W$ and $B$, solve the following problem.\nTakahashi's weight is $W {\\rm [kg]}$. (Note that the unit is ${\\rm kg}$.)  \nAn object attached with $n$ balloons will fly into the sky if and o...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments