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 getSunuke(int in)
{
  string input = to_string(in);
  int s = 0;
  for(int i = 0; i < (int)input.size(); ++i){
    char a = input[i];
    s+=a-'0';
  }
  return s;
}

int main()
{
  int K;
  cin >> K;
  int ans = 0;
  int c = 1;

  int f = 0;
  while(ans != K)
  {
    f = 0;
    for(int n = 1; n < 1000;n++)
    {
      if(float(float(c)/float(getSunuke(c))) > float(float(c+n)/float(getSunuke(c+n))))
      {
        f = 1;
        break;
      }
    }
    if(f == 0){
      ans++;
      printf("%i\n",c);
    }
    c++;
    // if(float(float(c)/float(getSunuke(c))) <= float(float(c+1)/float(getSunuke(c+1))))
    // {
    //
    //   ans++;
    //   printf("%i\n",c);
    // }
    // c++;
  }
  return 0;
}