Champernowne 验证 - Problème

#9063. Champernowne 验证

Statistiques

Ce problème est préparé par xiaowuc1 .

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

第 $k$ 个 Champernowne 数是通过将前 $k$ 个正整数依次连接在一起得到的。例如，第 $10$ 个 Champernowne 数是 $12345678910$。

给定一个正整数 $n$，判断它是否为一个 Champernowne 数，如果是，求出它是第几个。

输入格式

第一行包含一个整数 $n$ ($1 \le n \le 10^9$)。$n$ 不会包含前导零。

输出格式

如果 $n$ 是第 $k$ 个 Champernowne 数，输出 $k$。否则，输出 $-1$。

样例

样例输入 1

123456789

样例输出 1

样例输入 2

1000000000

样例输出 2

-1

样例输入 3

样例输出 3

-1

样例输入 4

样例输出 4

-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