Bob number --rubrik online test question

#1

let s(n) denote the sum of digits in the decimal notation of n.
s(123)=1+2+3=6
we will call an integer n a bob number when for all positive integers m such that m>n,
(n/s(n))<=(m/s(m))
holds. Given an integer k , list k smallest bob numbers.
eg:
k=5
output: 1 2 3 4 5

#2

As the constraints are so small , you can precompute the answers .