Unique Number

CodeChefOpen on judge ↗

You have two integers l and r. Find an integer x which satisfies the conditions below: - l≤x≤r - All digits of x are different. - (r-x)*(x-l) should be maximum If there are multiple answers, print the largest x. Input The first line contains two integers l and r ( 1≤l≤r≤10^5) Output Print the answer if exist, Otherwise, print -1. Sample Input: 5 10 Sample Output: 8

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI