Multiple Array

AtCoder

IDagc009_a

Time2000ms

Memory256MB

Difficulty—

There are an integer sequence $A_1,...,A_N$ consisting of $N$ terms, and $N$ buttons. When the $i$\-th $(1 ≦ i ≦ N)$ button is pressed, the values of the $i$ terms from the first through the $i$\-th are all incremented by $1$. There is also another integer sequence $B_1,...,B_N$. Takahashi will push the buttons some number of times so that for every $i$, $A_i$ will be a multiple of $B_i$. Find the minimum number of times Takahashi will press the buttons. ## Constraints * All input values are integers. * $1 ≦ N ≦ 10^5$ * $0 ≦ A_i ≦ 10^9(1 ≦ i ≦ N)$ * $1 ≦ B_i ≦ 10^9(1 ≦ i ≦ N)$ ## Input The input is given from Standard Input in the following format: $N$ $A_1$ $B_1$ : $A_N$ $B_N$ [samples]

Samples

Input #1

Output #1

7

Press the first button twice, the second button twice and the third button three times.

Input #2

Output #2

API Response (JSON)

{
  "problem": {
    "name": "Multiple Array",
    "description": {
      "content": "There are an integer sequence $A_1,...,A_N$ consisting of $N$ terms, and $N$ buttons. When the $i$\\-th $(1 ≦ i ≦ N)$ button is pressed, the values of the $i$ terms from the first through the $i$\\-th a",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "agc009_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "There are an integer sequence $A_1,...,A_N$ consisting of $N$ terms, and $N$ buttons. When the $i$\\-th $(1 ≦ i ≦ N)$ button is pressed, the values of the $i$ terms from the first through the $i$\\-th a...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments