QOJ.ac

QOJ

时间限制： 1.0 s 内存限制： 32 MB 总分： 25

#17115. VECI

该题目在以下比赛中使用过：

Croatian Open Competition in Informatics 2007/2008 Contest #4

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

给你一个整数 $X$。请找出由与 $X$ 相同的数字组成且大于 $X$ 的最小整数。

输入格式

输入的第一行包含一个整数 $X$ ($1 \le X \le 999999$)。

$X$ 的最高位数字不会是 $0$。

输出格式

在单行中输出结果。如果不存在这样的数，则输出 $0$。

样例

输入样例 1

输出样例 1

输入样例 2

输出样例 2

输入样例 3

输出样例 3

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

No issues in this category.