数字 - 题目

#12750. 数字

统计

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

小 Petya 喜欢整数。最近他学习了关于数字各位数字之和的不同性质。例如，如果一个数的各位数字之和能被 9 整除，那么这个数本身也能被 9 整除。

现在，小 Petya 对各位数字之和相等的数产生了兴趣。他请求他的哥哥 Dima 找出 $n$ 个各位数字之和相等且总和最小的正整数。Dima 还有其他重要的事情要做，所以他请你编写一个程序来帮他解决这个问题。

输入格式

输入包含一个整数 $n$ ($1 \le n \le 5000$)。

输出格式

输出 $n$ 个各位数字之和相等的正整数的最小可能总和。

样例

样例输入 1

样例输出 1

样例输入 2

样例输出 2

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