Sum of digits equation
Public  11м:3w  10xp  Programming  87.5% 
We define $ DS(n) = n + SOD(n) $ where SOD(n) is the sum of the digits of n (See problem 260)
It can be proved that $ 10^{13}+1 $ is the smallest integer such as the equation $ DS(x) = n $ has 3 solutions.
$$ \begin{equation*} 10^{13}+1= \begin{cases} DS(9999999999892) \\ DS(9999999999901) \\ DS(10000000000000) \end{cases} \end{equation*} $$ It can be proved too that $ n = 10^{2222222222224}+10000000000002 $ is the smallest integer with 6 solutions.
Obviously, if x is a solution we must have $x \lt n $. Thus, we can write a solution as $nx_i$
Find these solutions.
Answer format: $ x_1,x_2,x_3,x_4,x_5,x_6 $ // $x_i$ in ascending order
Example : 1,100,109 // For $ 10^{13}+1 $
[My timing: < 1 sec]
Thanks to sinan who helped me to improve this problem.
It can be proved that $ 10^{13}+1 $ is the smallest integer such as the equation $ DS(x) = n $ has 3 solutions.
$$ \begin{equation*} 10^{13}+1= \begin{cases} DS(9999999999892) \\ DS(9999999999901) \\ DS(10000000000000) \end{cases} \end{equation*} $$ It can be proved too that $ n = 10^{2222222222224}+10000000000002 $ is the smallest integer with 6 solutions.
Obviously, if x is a solution we must have $x \lt n $. Thus, we can write a solution as $nx_i$
Find these solutions.
Answer format: $ x_1,x_2,x_3,x_4,x_5,x_6 $ // $x_i$ in ascending order
Example : 1,100,109 // For $ 10^{13}+1 $
[My timing: < 1 sec]
Thanks to sinan who helped me to improve this problem.
New Members
 LzyRapx 3d:7h
 doc420836131 1w
 KennTedync 1w:3d
 CharlesUNSEM 2w:4d
 famx_pencil 2w:6d
Fresh Problems

Standard Nim 3d:20h
solved by 7 
Powerful Numbers II 5d:4h
solved by 8 
Powerful Numbers I 5d:5h
solved by 8 
Ordinal Numbers II 1w:5d
solved by 7 
Ordinal numbers I 1w:5d
solved by 8