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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		try(Scanner sc = new Scanner(System.in)){
			int k=sc.nextInt();
			int max=9;
			int count=9;
			int[] list=new int[k+1];
			for(int i=1; i<=k; i++) {
				list[i-1]=i;
			}
			if(k<=9) {
				for(int i=1; i<=k; i++) {
					System.out.println(k);
				}
			}
			else {
				for(int m=10; ; m++) {
					String str=String.valueOf(m);
					int strsum=0;
					for(int i=0; i<str.length(); i++) {
						strsum+=str.charAt(i)-'0';
					}
					int maxm=0;
					if(m==m/strsum) {
						maxm=m-1;
					}
					else {
						maxm=m/strsum;
					}
					if(maxm>max) {
						list[count]=m-1;
						count++;
					}
					if(count==k) {
						break;
					}
					
				}
				for(int i=0; i<k; i++) {
					System.out.println(list[i]);
				}
			}
			
		}
	}
}