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 Rust (1.15.1) (judge verdict: Wrong Answer)

// https://atcoder.jp/contests/arc099/tasks/arc099_b
//
#![allow(unused_imports)]
use std::io::*;
use std::fmt::*;
use std::str::*;
use std::cmp::*;
use std::collections::*;

macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
macro_rules! dvec {
    ($t:expr ; $len:expr) => {
        vec![$t; $len]
    };

    ($t:expr ; $len:expr, $($rest:expr),*) => {
        vec![dvec!($t; $($rest),*); $len]
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        println!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
    }
}

fn s(n: i64) -> i64 {
    let mut n = n;
    let mut sum = 0;
    while n >= 1 {
        sum += n % 10;
        n /= 10;
    }
    sum
}

fn rate(n: i64) -> f64 {
    (n as f64) / (s(n) as f64)
}

fn gen(sum: i64, keta: i64) -> i64 {
    if sum > keta * 9 {
        return -1;
    }
    let mut ret = 0;
    let mut left = sum - 1;
    let mut p10 = 1;
    for i in 0..keta-1 {
        ret += p10 * min(9, left);
        left -= min(9, left);
        p10 *= 10;
    }
    ret + p10 * (left + 1)
}

/// determines if n/S(n) > m/S(m) holds or not.
fn larger(n: i64, m: i64) -> bool {
    n * s(m) > m * s(n)
}

fn main() {
    input! {
        k: i64
    };

    let mut g = vec![];
    for i in 1..16 {
        for j in 1..16*9 {
            let cd = gen(j, i);
            if cd >= 1 {
                g.push(cd);
            }
        }
    }
    g.sort();

    let mut left = k;
    for i in 0..g.len() {
        let num = g[i];
        let mut ok = true;
        for j in i..g.len() {
            if larger(g[i], g[j]) {
                ok = false;
                break;
            }
        }
        if ok && left >= 1 {
            left -= 1;
            println!("{}", g[i]);
        }
    }
}