Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.
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 \leq k \leq 10\,000$$$).
A single number, denoting the $$$k$$$-th smallest perfect integer.
The first perfect integer is $$$19$$$ and the second one is $$$28$$$.
Codeforces (c) Copyright 2010-2020 Mike Mirzayanov