B. Perfect Numbertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe 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.InputA single line with a positive integer k (1 \leq k \leq 10\,000).OutputA single number, denoting the k-th smallest perfect integer.ExamplesInput1Output19Input2Output28NoteThe first perfect integer is 19 and the second one is 28.
Input1
Output19
['binary search', 'brute force', 'dp', 'implementation', 'number theory', '*1100']