Codeforces Round 861 (Div. 2)
C
Unlucky Numbers
Codeforces
1900
原题
← BD →
翻译中…

In this problem, unlike problem A, you need to look for unluckiest number, not the luckiest one.

翻译中…

Note that the constraints of this problem differ from such in problem A.

翻译中…

Olympus City recently launched the production of personal starships. Now everyone on Mars can buy one and fly to other planets inexpensively.

翻译中…

Each starship has a number —some positive integer $x$. Let's define the luckiness of a number $x$ as the difference between the largest and smallest digits of that number. For example, $142857$ has $8$ as its largest digit and $1$ as its smallest digit, so its luckiness is $8-1=7$. And the number $111$ has all digits equal to $1$, so its luckiness is zero.

翻译中…

Hateehc is a famous Martian blogger who often flies to different corners of the solar system. To release interesting videos even faster, he decided to buy himself a starship. When he came to the store, he saw starships with numbers from $l$ to $r$ inclusively. While in the store, Hateehc wanted to find a starship with the unluckiest number.

翻译中…

Since there are a lot of starships in the store, and Hateehc can't program, you have to help the blogger and write a program that answers his question.

翻译中…

image

翻译中…

Input

翻译中…

The first line contains an integer $t$ ($1 \le t \le 600$) —the number of test cases.

翻译中…

Each of the following $t$ lines contains a description of the test case. The description consists of two integers $l$, $r$ ($1 \le l \le r \le 10^{18}$) — the largest and smallest numbers of the starships in the store.

翻译中…

Output

翻译中…

Print $t$ lines, one line for each test case, containing the unluckiest starship number in the store.

翻译中…

If there are several ways to choose the unluckiest number, output any of them.

翻译中…

Note

翻译中…

Let's look at two test examples:

翻译中…
  • the luckiness of the number $59$ is $9 - 5 = 4$;
  • the luckiness of $60$ equals $6 - 0 = 6$;
  • the luckiness of $61$ equals $6 - 1 = 5$;
  • the luckiness of $62$ equals $6 - 2 = 4$;
  • the luckiness of $63$ is $6 - 3 = 3$.
翻译中…

So the unluckiest number is $63$.

翻译中…

In the fifth test case, the unluckiest numbers are $1$, $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$, $11$, $22$, $33$, $44$, $55$, $66$, $77$, $88$, $99$, so you are allowed to choose any of them.

翻译中…

样例

Input #1
5
59 63
42 49
48 53
90 90
1 100
Output #1
63
44
53
90
1
InputCopy OutputCopy
题目信息
题号
1808C
时间限制
2 s
内存限制
256 MB
标签
暴力
动态规划
贪心
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。