Preparando MOJI

Perfect Number

2000ms 262144K

Description:

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.

Input:

A single line with a positive integer $$$k$$$ ($$$1 \leq k \leq 10\,000$$$).

Output:

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

Sample Input:

1

Sample Output:

19

Sample Input:

2

Sample Output:

28

Note:

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

Informação

Codeforces

Provedor Codeforces

Código CF919B

Tags

binary searchbrute forcedpimplementationnumber theory

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 09:22:59

Relacionados

Nada ainda