AtCoder Crackers

AtCoder

IDabc105_a

Time2000ms

Memory256MB

Difficulty—

Takahashi has decided to distribute $N$ AtCoder Crackers to $K$ users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. ## Constraints * $1 \leq N,K \leq 100$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $K$ [samples]

Samples

Input #1

7 3

Output #1

1

When the users receive two, two and three crackers, respectively, the (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user, is $1$.

Input #2

100 10

Output #2

0

The crackers can be distributed evenly.

Input #3

1 1

Output #3

API Response (JSON)

{
  "problem": {
    "name": "AtCoder Crackers",
    "description": {
      "content": "Takahashi has decided to distribute $N$ AtCoder Crackers to $K$ users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the large",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc105_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Takahashi has decided to distribute $N$ AtCoder Crackers to $K$ users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the large...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments