Replacing Integer

AtCoder

IDabc161_c

Time2000ms

Memory256MB

Difficulty—

Given any integer $x$, Aoki can do the operation below. Operation: Replace $x$ with the absolute difference of $x$ and $K$. You are given the initial value of an integer $N$. Find the minimum possible value taken by $N$ after Aoki does the operation zero or more times. ## Constraints * $0 ≤ N ≤ 10^{18}$ * $1 ≤ K ≤ 10^{18}$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $K$ [samples]

Samples

Input #1

7 4

Output #1

1

Initially, $N=7$.
After one operation, $N$ becomes $|7-4| = 3$.
After two operations, $N$ becomes $|3-4| = 1$, which is the minimum value taken by $N$.

Input #2

2 6

Output #2

2

$N=2$ after zero operations is the minimum.

Input #3

1000000000000000000 1

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Replacing Integer",
    "description": {
      "content": "Given any integer $x$, Aoki can do the operation below. Operation: Replace $x$ with the absolute difference of $x$ and $K$. You are given the initial value of an integer $N$. Find the minimum possible",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc161_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given any integer $x$, Aoki can do the operation below.\nOperation: Replace $x$ with the absolute difference of $x$ and $K$.\nYou are given the initial value of an integer $N$. Find the minimum possible...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments