[EC Final 2022] Best Carry Player 2

Luogu

IDLGP9718

Time3000ms

Memory1024MB

DifficultyP5

2022O2优化数位 DPICPCEC Final

Given a positive integer $x$, find the minimum positive integer $y$ such that the number of $\textbf{carries}^1$ of $x+y$ is exactly $k$. We adds numbers $\textbf{by column addition in base-ten}$, just like what we normally do in primary school. For example, there are two carries in the following addition. ![](https://cdn.luogu.com.cn/upload/image_hosting/pfnper3r.png) $^1$ which means ``进位`` in Chinese. ## Input The first line contains an integer $T$ $(1\leq T\leq 10^5)$ $-$ the number of test cases. For each test case, the first line contains two integers $x, k$ $(1\leq x < 10^{18}, 0\leq k \leq 18)$. ## Output For each test case, output one integer representing the answer in one line. If there is no solution, output $-1$ instead. [samples]

Samples

Input #1

4
12345678 0
12345678 5
12345678 18
990099 5

Output #1

1
54322
999999999987654322
9910

API Response (JSON)

{
  "problem": {
    "name": "[EC Final 2022] Best Carry Player 2",
    "description": {
      "content": "Given a positive integer $x$, find the minimum positive integer $y$ such that the number of $\\textbf{carries}^1$ of $x+y$ is exactly $k$. We adds numbers $\\textbf{by column addition in base-ten}$, ju",
      "description_type": "Markdown"
    },
    "platform": "Luogu",
    "limit": {
      "time_limit": 3000,
      "memory_limit": 1048576
    },
    "difficulty": {
      "LuoguStyle": "P5"
    },
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "LGP9718"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given a positive integer $x$, find the minimum positive integer $y$ such that the number of $\\textbf{carries}^1$ of $x+y$ is exactly $k$.\n\nWe adds numbers $\\textbf{by column addition in base-ten}$, ju...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments