Problem:
Score : 500 points

Problem Statement

Let S(n) denote the sum of the digits in the decimal notation of n.
For example, S(123) = 1 + 2 + 3 = 6.

We will call an integer n a Snuke number when, for all positive integers m such that m > n, \frac{n}{S(n)} \leq \frac{m}{S(m)} holds.

Given an integer K, list the K smallest Snuke numbers.

Constraints

1 \leq K

The K-th smallest Snuke number is not greater than 10^{15}.

Input

Input is given from Standard Input in the following format:

K

Output

Print K lines. The i-th line should contain the i-th smallest Snuke number.

Sample Input 1

10

Sample Output 1

1
2
3
4
5
6
7
8
9
19

Solution in JavaScript (node.js v5.12) (judge verdict: Wrong Answer)


'use strict'
function F(x) {
  let s = 0
  let y = x
  while (y > 0) {
    s += y % 10
    y /= 10
  }
  return x / s
}
function Main(input) {
  input = input.split("\n")
  let line1 = input[0].split(' ')
  let K = parseInt(line1[0])
  console.log(1)
  let x = 2
  for (let i = 1; i < K; i += 1) {
    let z = x, y = x
    let fm = F(z)
    for (let d = 1; d <= x; d *= 10) {
      y = y + (9 - (y / d) % 10) * d
      let fy = F(y)
      if (fy < fm) {
        z = y
        fm = fy
      }
    }
    console.log(z)
    x = z + 1
  }
  return 0
}
Main(require("fs").readFileSync("/dev/stdin", "utf8"))