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 C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int i,n,s=8,t,k,k1,t1;
	scanf("%d",&n);
	for(i=1;i<=8;i++)
		printf("%d\n",i);
	for(i=9;s<n;i++)
	{
		t=i;
		k=0;
		while(t!=0)
		{
			k+=t%10;
			t/=10;	
		}
		t1=i+1;
		k1=0;
		while(t1!=0)
		{
			k1+=t1%10;
			t1/=10;	
		}
		if(i/k<(i+1)/k1)
		{
			printf("%d\n",i);
			s++;
		}
	}
	return 0;
}