CESTA - 题目

#16374. CESTA

统计

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

一天早晨，Mirko 纯属偶然地在马路中间捡到了一个正整数 $N$。由于 Mirko 非常喜欢数字 30，他想知道通过重新排列他捡到的这个数字的各个数位，能够得到的最大的 30 的倍数是多少。

请帮助我们的主人公，写一个程序来计算这个数字（如果存在的话）。

输入格式

输入的第一行也是唯一的一行包含整数 $N$，它最多由 $10^5$ 个数位组成。

输出格式

输出的第一行也是唯一的一行必须包含题目所要求的数字（如果存在）。如果不存在，输出 -1。

样例

输入样例 1

输出样例 1

输入样例 2

输出样例 2

输入样例 3

输出样例 3

-1

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0