Nearest Beautiful Number (hard version) solution codeforces
It is a complicated version of problem F1. The difference between them is the constraints (F1: , F2: ).
You are given an integer beautiful.. Find the minimum integer such that and the number is –
A number is called beautiful if its decimal representation having no leading zeroes contains no more than different digits. E.g. if , the numbers , , and are –beautiful whereas the numbers , and are not.–
The first line contains one integer( ) — the number of test cases. Then test cases follow.
Each test case consists of one line containing two integersand ( , ).
For each test case output on a separate line beautiful integer such that .— the minimum –
6 2021 3 177890 2 34512 3 724533 4 998244353 1 12345678 10
2021 181111 34533 724542 999999999 12345678