Nearest Beautiful Number (easy version) solution codeforces
It is a simplified version of problem F2. 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 –
4 1 1 221 2 177890 2 998244353 1
1 221 181111 999999999
Solution: Click here