CF919B.Perfect Number

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

We consider a positive integer perfect, if and only if the sum of its digits is exactly $10$ . Given a positive integer $k$ , your task is to find the $k$ -th smallest perfect positive integer.

输入格式

A single line with a positive integer $k$ ( $1<=k<=10000$ ).

输出格式

A single number, denoting the $k$ -th smallest perfect integer.

输入输出样例

输入#1
```
1
```
输出#1
```
19
```
输入#2
```
2
```
输出#2
```
28
```

说明/提示

The first perfect integer is $19$ and the second one is $28$ .

首页