Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- One morning, completely by chance, Mirko found a positive integer N in the middle of the street. Since Mirko adores the number 30, he wants to know the maximum multiple of the number 30 that can be obtained by shuffling the digits of the number he found in the street.
- Help our hero and write a programme that calculates that number (if it exists).
- INPUT
- The first and only line of input contains the integer N, consisting of at most 10^5 digits.
- OUTPUT
- The first and only line of output must contain the required number from the task, if it exists. If it
- doesn’t exist, output -1.
- SAMPLE TEST DATA
- input input input
- 30 102 2931
- output output output
- 30 210 -1
- Time limit 1 s
- Memory limit 32 MB
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement