|
Matcom Online Grader
Faculty of Mathematics and Computer Science of University of Havana
ℹ️ We've recently migrated MOG to a new server with a different grader. As a result, some features—especially those related to submission evaluation—might not work correctly. If you encounter any issues, please report them by clicking the exclamation icon in the bottom right corner of the website.
A - At most twice
Languages: C, C++, Java, Haskell, Pascal, Python, JavaScript, Tiger, C#
Time & Memory limits: (details)
Given a positive integer $U$, find the largest integer $L$ such that $L \leq U$ and $L$ does not contain any digit more than twice.
Input
The input consists of a single line that contains an integer $U$ ($1 \leq U \leq 10^{18}$).
Output
Output a line with an integer representing the largest number less than or equal to $U$ that does not contain any digit more than twice.
Sample test(s)
Input
2210102960
Output
2210099887
Input
1000000000000000000
Output
998877665544332211
Input
1001223343
Output
998877665
Input
20152015
Output
20152015