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



Sample input:
10


Sample output:
1
2
3
4
5
6
7
8
9
19

Submission status: Wrong Answer

Solution code:

K = int(input())
aaa = 1
ans_array = []

def sunuke(n):
    re = 0
    tmp = n
    while n:
        re += n % 10
        n = n//10
    re = tmp/re
    print(re)

def print_sunuke():
    global aaa
    num = aaa % 10
    if num == 0:
        aaa += 1
        print_sunuke()
        return
    nine = aaa // 10
    ans = str(num) + "9" * nine
    aaa += 1
    ans_array.append(int(ans))




for i in range(10000):

    print_sunuke()

ans_array.append(1899)
ans_array.append(2899)
ans_array.append(3899)
ans_array.append(4899)
ans_array.append(5899)
ans_array.append(6899)
ans_array.append(7899)
ans_array.append(8899)
ans_array.append(9899)
ans_array.append(18999)
ans_array.append(28999)
ans_array.append(38999)
ans_array.append(48999)
ans_array.append(58999)
ans_array.append(68999)
ans_array.append(78999)
ans_array.append(88999)
ans_array.append(98999)
ans_array.append(189999)
ans_array.append(289999)
ans_array.append(389999)
ans_array.append(489999)
ans_array.append(589999)
ans_array.append(689999)
ans_array.append(789999)
ans_array.append(889999)
ans_array.append(989999)
ans_array.append(1899999)
ans_array.append(2899999)
ans_array.append(3899999)
ans_array.append(4899999)
ans_array.append(5899999)
ans_array.append(6899999)
ans_array.append(7899999)
ans_array.append(8899999)
ans_array.append(9899999)


ans_array.sort()

for i in range(K):
    print(ans_array[i])

Submission status: Wrong Answer

Solution code:
import sys
K=int(input())
L=[1,2,3,4,5,6,7,8,9,19,29,39,49,59,69,79,89,99,199,299,399,499,599,699,799,899,999]
L=set(L)
for i in range(17):
    for j in range(i*10):
        L.add(pow(10,i) * j + pow(10,i)-1)
L=list(L)
L.sort()
ans=L[:K]
print('\n'.join(map(str,ans)))

Submission status: Wrong Answer

Solution code:
lst = [str(i) for i in range(1, 10)]
for i in range(1, 10):
  lst.append(str(i) + "9")
for i in range(1, 19):
  lst.append(str(i) + "99")

for j in range(3, 16):
  for i in range(1, 10):
    lst.append(str(i) + "9" * j)
#print(lst)
print(*lst[:int(input())], sep="\n")

Submission status: Wrong Answer

Solution code:
from sys import stdin
n = int(stdin.readline())
c = [1,2,3,4,5,6,7,8,9]
i = 0
while len(c) < n:
 c.append( c[i] * 10 + 9)
 i += 1
for i in c:
 print i

Submission status: Wrong Answer

Solution code:

k = int(input())
count = 0
top = 1
nines = 0
while True:
    if count == 9:
        print(19)
        nines += 1
        top = 1
    elif count == 18:
        print(199)
        nines += 1
        top = 1
    else:
        print(str(top) + "9" * nines)

    count += 1
    if count >= k:
        break
    top += 1
    if top == 11:
        top = 1
        nines += 1

Submission status: Wrong Answer

Solution code:
k=int(input())
for x in range(1,k+1):
    if x%9!=0:
         print((x%9+1)*10**int(x/9)-1)
    else:
         print(10**int(x/9)-1)

Submission status: Wrong Answer

Solution code:
k=int(input())
for x in range(1,k+1):
    if x%9!=0:
         print((x%9+1)*10**(x//9)-1)
    else:
         print(10**(x//9)-1)

Submission status: Wrong Answer

Solution code:
k = int(input())

n = 1
d = 1
nine = 0
for _ in range(k):
    print(n*10**(d-1)+nine)
    n += 1
    if n == d*10:
        n = d
        d += 1
        nine = nine*10+9

Submission status: Wrong Answer

Solution code:
a = int(input())

b = [1,2,3,4,5,6,7,8,9]

if a <= 9:
	for i in range(a):
		print(b[i])

else:
	for i in range(9):
		print(b[i])
	for i in range(a - 9):
		print(9 + (i + 1)*10)

Submission status: Wrong Answer

Solution code:
k = int(input())
kosuu = [9,9,10]
for i in range(2,11):
	kosuu.append((10-i)+10*i)
kosuu.append(111)
kosuu.append(121)

ans = []
counter = 0
i = 0
while counter < k:
	if i == 0:
		for e in range(1,kosuu[i]):
			ans.append(e)
		counter += 8
		i += 1
	else:
		first = (i-1)*(10**i)+(10**i)-1
		for e in range(kosuu[i]):
			ans.append(first+e*10**i)
		counter += kosuu[i]
		i += 1
for s in range(k):
	print(ans[s])

Submission status: Wrong Answer

Solution code:

K = int(input())
aaa = 1
ans_array = []

def sunuke(n):
    re = 0
    tmp = n
    while n:
        re += n % 10
        n = n//10
    re = tmp/re
    print(re)

def print_sunuke():
    global aaa
    num = aaa % 10
    if num == 0:
        aaa += 1
        print_sunuke()
        return
    nine = aaa // 10
    ans = str(num) + "9" * nine
    aaa += 1
    ans_array.append(int(ans))




for i in range(10000):

    print_sunuke()

ans_array.append(1899)
ans_array.append(2899)
ans_array.append(3899)
ans_array.append(4899)
ans_array.append(5899)
ans_array.append(6899)
ans_array.append(7899)
ans_array.append(8899)
ans_array.append(9899)
ans_array.append(18999)
ans_array.append(28999)
ans_array.append(38999)
ans_array.append(48999)
ans_array.append(58999)
ans_array.append(68999)
ans_array.append(78999)
ans_array.append(88999)
ans_array.append(98999)
ans_array.append(18999)
ans_array.append(28999)
ans_array.append(38999)
ans_array.append(48999)
ans_array.append(58999)
ans_array.append(68999)
ans_array.append(78999)
ans_array.append(88999)
ans_array.append(98999)
ans_array.append(189999)
ans_array.append(289999)
ans_array.append(389999)
ans_array.append(489999)
ans_array.append(589999)
ans_array.append(689999)
ans_array.append(789999)
ans_array.append(889999)
ans_array.append(989999)
ans_array.append(189999)
ans_array.append(289999)
ans_array.append(389999)
ans_array.append(489999)
ans_array.append(589999)
ans_array.append(689999)
ans_array.append(789999)
ans_array.append(889999)
ans_array.append(989999)

ans_array.sort()

for i in range(K):
    print(ans_array[i])

Submission status: Wrong Answer

Solution code:

k = int(input())
count = 0
top = 1
nines = 0
while True:
    if count == 9:
        print(19)
        nines += 1
        top = 1
    else:
        print(str(top) + "9" * nines)

    count += 1
    if count >= k:
        break
    top += 1
    if top == 11:
        top = 1
        nines += 1

Submission status: Wrong Answer

Solution code:
def main():
  seq = [2, 3, 4, 5, 6, 7, 8, 9, 19, 29, 39, 49, 59, 69, 79, 89, 99, 199, 299, 399, 499, 599, 699, 799, 899, 999, 1099, 1199, 1299, 1399, 1499, 1599, 1699, 1799, 1899, 1999, 2999, 3999, 4999, 5999, 6999, 7999, 8999, 9999, 10999, 11999, 12999, 13999, 14999, 15999, 16999, 17999, 18999, 19999, 20999, 21999, 22999, 23999, 24999, 25999, 26999, 27999, 28999, 29999, 39999, 49999, 59999, 69999, 79999, 89999, 99999, 109999, 119999, 129999, 139999, 149999, 159999, 169999, 179999, 189999, 199999, 209999, 219999, 229999, 239999, 249999, 259999, 269999, 279999, 289999, 299999, 309999, 319999, 329999, 339999, 349999, 359999, 369999, 379999, 389999, 399999, 499999, 599999, 699999, 799999, 899999, 999999, 1099999, 1199999, 1299999, 1399999, 1499999, 1599999, 1699999, 1799999, 1899999, 1999999, 2099999, 2199999, 2299999, 2399999, 2499999, 2599999, 2699999, 2799999, 2899999, 2999999, 3099999, 3199999, 3299999, 3399999, 3499999, 3599999, 3699999, 3799999, 3899999, 3999999, 4099999, 4199999, 4299999, 4399999, 4499999, 4599999, 4699999, 4799999, 4899999, 4999999, 5999999, 6999999, 7999999, 8999999, 9999999, 10999999, 11999999, 12999999, 13999999, 14999999, 15999999, 16999999, 17999999, 18999999, 19999999, 20999999, 21999999, 22999999, 23999999, 24999999, 25999999, 26999999, 27999999, 28999999, 29999999, 30999999, 31999999, 32999999, 33999999, 34999999, 35999999, 36999999, 37999999, 38999999, 39999999, 40999999, 41999999, 42999999, 43999999, 44999999, 45999999, 46999999, 47999999, 48999999, 49999999, 50999999, 51999999, 52999999, 53999999, 54999999, 55999999, 56999999, 57999999, 58999999, 59999999, 69999999, 79999999, 89999999, 99999999, 109999999, 119999999, 129999999, 139999999, 149999999, 159999999, 169999999, 179999999, 189999999, 199999999, 209999999, 219999999, 229999999, 239999999, 249999999, 259999999, 269999999, 279999999, 289999999, 299999999, 309999999, 319999999, 329999999, 339999999, 349999999, 359999999, 369999999, 379999999, 389999999, 399999999, 409999999, 419999999, 429999999, 439999999, 449999999, 459999999, 469999999, 479999999, 489999999, 499999999, 509999999, 519999999, 529999999, 539999999, 549999999, 559999999, 569999999, 579999999, 589999999, 599999999, 609999999, 619999999, 629999999, 639999999, 649999999, 659999999, 669999999, 679999999, 689999999, 699999999, 799999999, 899999999, 999999999, 1099999999, 1199999999, 1299999999, 1399999999, 1499999999, 1599999999, 1699999999, 1799999999, 1899999999, 1999999999, 2099999999, 2199999999, 2299999999, 2399999999, 2499999999, 2599999999, 2699999999, 2799999999, 2899999999, 2999999999, 3099999999, 3199999999, 3299999999, 3399999999, 3499999999, 3599999999, 3699999999, 3799999999, 3899999999, 3999999999, 4099999999, 4199999999, 4299999999, 4399999999, 4499999999, 4599999999, 4699999999, 4799999999, 4899999999, 4999999999, 5099999999, 5199999999, 5299999999, 5399999999, 5499999999, 5599999999, 5699999999, 5799999999, 5899999999, 5999999999, 6099999999, 6199999999, 6299999999, 6399999999, 6499999999, 6599999999, 6699999999, 6799999999, 6899999999, 6999999999, 7099999999, 7199999999, 7299999999, 7399999999, 7499999999, 7599999999, 7699999999, 7799999999, 7899999999, 7999999999, 8999999999, 9999999999, 10999999999, 11999999999, 12999999999, 13999999999, 14999999999, 15999999999, 16999999999, 17999999999, 18999999999, 19999999999, 20999999999, 21999999999, 22999999999, 23999999999, 24999999999, 25999999999, 26999999999, 27999999999, 28999999999, 29999999999, 30999999999, 31999999999, 32999999999, 33999999999, 34999999999, 35999999999, 36999999999, 37999999999, 38999999999, 39999999999, 40999999999, 41999999999, 42999999999, 43999999999, 44999999999, 45999999999, 46999999999, 47999999999, 48999999999, 49999999999, 50999999999, 51999999999, 52999999999, 53999999999, 54999999999, 55999999999, 56999999999, 57999999999, 58999999999, 59999999999, 60999999999, 61999999999, 62999999999, 63999999999, 64999999999, 65999999999, 66999999999, 67999999999, 68999999999, 69999999999, 70999999999, 71999999999, 72999999999, 73999999999, 74999999999, 75999999999, 76999999999, 77999999999, 78999999999, 79999999999, 80999999999, 81999999999, 82999999999, 83999999999, 84999999999, 85999999999, 86999999999, 87999999999, 88999999999, 89999999999, 99999999999, 109999999999, 119999999999, 129999999999, 139999999999, 149999999999, 159999999999, 169999999999, 179999999999, 189999999999, 199999999999, 209999999999, 219999999999, 229999999999, 239999999999, 249999999999, 259999999999, 269999999999, 279999999999, 289999999999, 299999999999, 309999999999, 319999999999, 329999999999, 339999999999, 349999999999, 359999999999, 369999999999, 379999999999, 389999999999, 399999999999, 409999999999, 419999999999, 429999999999, 439999999999, 449999999999, 459999999999, 469999999999, 479999999999, 489999999999, 499999999999, 509999999999, 519999999999, 529999999999, 539999999999, 549999999999, 559999999999, 569999999999, 579999999999, 589999999999, 599999999999, 609999999999, 619999999999, 629999999999, 639999999999, 649999999999, 659999999999, 669999999999, 679999999999, 689999999999, 699999999999, 709999999999, 719999999999, 729999999999, 739999999999, 749999999999, 759999999999, 769999999999, 779999999999, 789999999999, 799999999999, 809999999999, 819999999999, 829999999999, 839999999999, 849999999999, 859999999999, 869999999999, 879999999999, 889999999999, 899999999999, 909999999999, 919999999999, 929999999999, 939999999999, 949999999999, 959999999999, 969999999999, 979999999999, 989999999999, 999999999999, 1099999999999, 1199999999999, 1299999999999, 1399999999999, 1499999999999, 1599999999999, 1699999999999, 1799999999999, 1899999999999, 1999999999999, 2099999999999, 2199999999999, 2299999999999, 2399999999999, 2499999999999, 2599999999999, 2699999999999, 2799999999999, 2899999999999, 2999999999999, 3099999999999, 3199999999999, 3299999999999, 3399999999999, 3499999999999, 3599999999999, 3699999999999, 3799999999999, 3899999999999, 3999999999999, 4099999999999, 4199999999999, 4299999999999, 4399999999999, 4499999999999, 4599999999999, 4699999999999, 4799999999999, 4899999999999, 4999999999999, 5099999999999, 5199999999999, 5299999999999, 5399999999999, 5499999999999, 5599999999999, 5699999999999, 5799999999999, 5899999999999, 5999999999999, 6099999999999, 6199999999999, 6299999999999, 6399999999999, 6499999999999, 6599999999999, 6699999999999, 6799999999999, 6899999999999, 6999999999999, 7099999999999, 7199999999999, 7299999999999, 7399999999999, 7499999999999, 7599999999999, 7699999999999, 7799999999999, 7899999999999, 7999999999999, 8099999999999, 8199999999999, 8299999999999, 8399999999999, 8499999999999, 8599999999999, 8699999999999, 8799999999999, 8899999999999, 8999999999999, 9099999999999, 9199999999999, 9299999999999, 9399999999999, 9499999999999, 9599999999999, 9699999999999, 9799999999999, 9899999999999, 9999999999999, 9999999999999, 10999999999999, 11999999999999, 12999999999999, 13999999999999, 14999999999999, 15999999999999, 16999999999999, 17999999999999, 18999999999999, 19999999999999, 20999999999999, 21999999999999, 22999999999999, 23999999999999, 24999999999999, 25999999999999, 26999999999999, 27999999999999, 28999999999999, 29999999999999, 30999999999999, 31999999999999, 32999999999999, 33999999999999, 34999999999999, 35999999999999, 36999999999999, 37999999999999, 38999999999999, 39999999999999, 40999999999999, 41999999999999, 42999999999999, 43999999999999, 44999999999999, 45999999999999, 46999999999999, 47999999999999, 48999999999999, 49999999999999, 50999999999999, 51999999999999, 52999999999999, 53999999999999, 54999999999999, 55999999999999, 56999999999999, 57999999999999, 58999999999999, 59999999999999, 60999999999999, 61999999999999, 62999999999999, 63999999999999, 64999999999999, 65999999999999, 66999999999999, 67999999999999, 68999999999999, 69999999999999, 70999999999999, 71999999999999, 72999999999999, 73999999999999, 74999999999999, 75999999999999, 76999999999999, 77999999999999, 78999999999999, 79999999999999, 80999999999999, 81999999999999, 82999999999999, 83999999999999, 84999999999999, 85999999999999, 86999999999999, 87999999999999, 88999999999999, 89999999999999, 90999999999999, 91999999999999, 92999999999999, 93999999999999, 94999999999999, 95999999999999, 96999999999999, 97999999999999, 98999999999999, 99999999999999, 100999999999999, 101999999999999, 102999999999999, 103999999999999, 104999999999999, 105999999999999, 106999999999999, 107999999999999, 108999999999999, 109999999999999, 119999999999999, 129999999999999, 139999999999999, 149999999999999, 159999999999999, 169999999999999, 179999999999999, 189999999999999, 199999999999999, 209999999999999, 219999999999999, 229999999999999, 239999999999999, 249999999999999, 259999999999999, 269999999999999, 279999999999999, 289999999999999, 299999999999999, 309999999999999, 319999999999999, 329999999999999, 339999999999999, 349999999999999, 359999999999999, 369999999999999, 379999999999999, 389999999999999, 399999999999999, 409999999999999, 419999999999999, 429999999999999, 439999999999999, 449999999999999, 459999999999999, 469999999999999, 479999999999999, 489999999999999, 499999999999999, 509999999999999, 519999999999999, 529999999999999, 539999999999999, 549999999999999, 559999999999999, 569999999999999, 579999999999999, 589999999999999, 599999999999999, 609999999999999, 619999999999999, 629999999999999, 639999999999999, 649999999999999, 659999999999999, 669999999999999, 679999999999999, 689999999999999, 699999999999999, 709999999999999, 719999999999999, 729999999999999, 739999999999999, 749999999999999, 759999999999999, 769999999999999, 779999999999999, 789999999999999, 799999999999999, 809999999999999, 819999999999999, 829999999999999, 839999999999999, 849999999999999, 859999999999999, 869999999999999, 879999999999999, 889999999999999, 899999999999999, 909999999999999, 919999999999999, 929999999999999, 939999999999999, 949999999999999, 959999999999999, 969999999999999, 979999999999999, 989999999999999, 999999999999999]
  k = int(input())
  assert(k <= len(seq))
  for x in seq[:k]:
    print(x)

if __name__ == "__main__":
  main()

Submission status: Wrong Answer

Solution code:

K = int(input())
aaa = 1
ans_array = []

def sunuke(n):
    re = 0
    tmp = n
    while n:
        re += n % 10
        n = n//10
    re = tmp/re
    print(re)

def print_sunuke():
    global aaa
    num = aaa % 10
    if num == 0:
        aaa += 1
        print_sunuke()
        return
    nine = aaa // 10
    ans = str(num) + "9" * nine
    aaa += 1
    ans_array.append(int(ans))




for i in range(10000):

    print_sunuke()

ans_array.append(1899)
ans_array.append(2899)
ans_array.append(3899)
ans_array.append(4899)
ans_array.append(5899)
ans_array.append(6899)
ans_array.append(7899)
ans_array.append(8899)
ans_array.append(9899)
ans_array.append(18999)
ans_array.append(28999)
ans_array.append(38999)
ans_array.append(48999)
ans_array.append(58999)
ans_array.append(68999)
ans_array.append(78999)
ans_array.append(88999)
ans_array.append(98999)

ans_array.sort()

for i in range(K):
    print(ans_array[i])

Submission status: Wrong Answer

Solution code:
K = int(input())
c = [9, 9, 19, 28, 37, 46, 55, 64, 73, 82, 91, 191, 919]
inc = 1
idx = 0
res = 0
for i in range(1, K+1):
	res += inc
	c[idx] -= 1
	if c[idx] == 0:
		idx += 1
		inc *= 10
	print(res)

Submission status: Wrong Answer

Solution code:

K = int(input())
aaa = 1
ans_array = []

def sunuke(n):
    re = 0
    tmp = n
    while n:
        re += n % 10
        n = n//10
    re = tmp/re
    print(re)

def print_sunuke():
    global aaa
    num = aaa % 10
    if num == 0:
        aaa += 1
        print_sunuke()
        return
    nine = aaa // 10
    ans = str(num) + "9" * nine
    aaa += 1
    ans_array.append(int(ans))




for i in range(10000):

    print_sunuke()

ans_array.append(1899)
ans_array.append(2899)
ans_array.append(3899)
ans_array.append(4899)
ans_array.append(5899)
ans_array.append(6899)
ans_array.append(7899)
ans_array.append(8899)
ans_array.append(9899)

ans_array.sort()

for i in range(K):
    print(ans_array[i])

Submission status: Wrong Answer

Solution code:
k = int(input())
for i in range(1, k + 1):
    if(i <= 9):
        print(i)
    else:
        print((i - 9) * 10 + 9)

Submission status: Wrong Answer

Solution code:

K = int(input())
aaa = 1
ans_array = []

def sunuke(n):
    re = 0
    tmp = n
    while n:
        re += n % 10
        n = n//10
    re = tmp/re
    print(re)

def print_sunuke():
    global aaa
    num = aaa % 10
    if num == 0:
        aaa += 1
        print_sunuke()
        return
    nine = aaa // 10
    ans = str(num) + "9" * nine
    aaa += 1
    ans_array.append(int(ans))




for i in range(10000):

    print_sunuke()

ans_array.append(1899)

ans_array.sort()

for i in range(K):
    print(ans_array[i])

Submission status: Wrong Answer

Solution code:
from sys import stdin 
c = [1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 29, 39, 49, 59, 69, 79, 89, 99, 199, 299, 399, 499, 599, 699, 799, 899, 999, 1999, 2999, 3999, 4999, 5999, 6999, 7999, 8999, 9999, 19999, 29999, 39999, 49999, 59999, 69999, 79999, 89999, 99999, 199999, 299999, 399999, 499999, 599999, 699999, 799999, 899999, 999999, 1999999, 2999999, 3999999, 4999999, 5999999, 6999999, 7999999, 8999999, 9999999, 19999999, 29999999, 39999999, 49999999, 59999999, 69999999, 79999999, 89999999, 99999999, 199999999, 299999999, 399999999, 499999999, 599999999, 699999999, 799999999, 899999999, 999999999, 1999999999, 2999999999, 3999999999, 4999999999, 5999999999, 6999999999, 7999999999, 8999999999, 9999999999, 19999999999, 29999999999, 39999999999, 49999999999, 59999999999, 69999999999, 79999999999, 89999999999, 99999999999, 199999999999, 299999999999, 399999999999, 499999999999, 599999999999, 699999999999, 799999999999, 899999999999, 999999999999, 1999999999999, 2999999999999, 3999999999999, 4999999999999, 5999999999999, 6999999999999, 7999999999999, 8999999999999, 9999999999999, 19999999999999, 29999999999999, 39999999999999, 49999999999999, 59999999999999, 69999999999999, 79999999999999, 89999999999999, 99999999999999, 199999999999999, 299999999999999, 399999999999999, 499999999999999, 599999999999999, 699999999999999, 799999999999999, 899999999999999, 999999999999999]
n = int(stdin.readline())
c = set(c)
c = list(c)
c.sort()
c = c[:n] 
for i in c:
    print i 
if n > 808:
    while True:
        xx = 3

Submission status: Wrong Answer

Solution code:
k = int(input())
for i in range(9):
    k -= 1
    print(i + 1)
    if not k:
        break
coef = 10
count = 1
res = []
for i in range(k):
    if count == 10:
        count = 1
        coef *= 10
    print(count * coef + 8 + 1)
    count += 1

Submission status: Wrong Answer

Solution code:
import sys
K=int(input())
L=[1,2,3,4,5,6,7,8,9,19,29,39,49,59,69,79,89,99,199,299,399,499,599,699,799,899,999]
L=set(L)
for i in range(16):
    for j in range(i*10):
        L.add(pow(10,i) * j + pow(10,i)-1)
L=list(L)
L.sort()
ans=L[:K]
print('\n'.join(map(str,ans)))

Submission status: Wrong Answer

Solution code:
k = int(input())
if k <= 9:
	for i in range(1, k + 1):
		print(i)
else:
	for i in range(1, 10):
		print(i)

	k -= 9

	beki = 1
	while k >= 9:
		for i in range(2, 11):
			print(i * (10 ** beki) - 1)
		beki += 1
		k -= 9

	for i in range(2, k + 2):
		print(i * (10 ** beki) - 1)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import array
from bisect import *
from collections import *
import fractions
import heapq 
from itertools import *
import math
import random
import re
import string
import sys

def S(k):
    return sum(int(x) for x in str(k))
def T(k):
    return k / S(k)

def exp1():
    
    for k in range(1, 1300):
        # print("{}/S({}) = {}".format(k, k, k / S(k)))
        print("{}\t{}".format(k, k / S(k)))
    
    
    MAX = 10300000
    ans = [None] * MAX
    for k in range(1, MAX):
        # print("{}/S({}) = {}".format(k, k, k / S(k)))
        # print("{}\t{}".format(k, k / S(k)))
        ans[k] = k / S(k)
    
    mins = [None] * MAX
    k = MAX - 1
    mins[k] = ans[k]
    k -= 1
    while k >= 1:
        if (ans[k] <= mins[k+1]):
            print("{} is answer".format(k))
        mins[k] = min(mins[k+1], ans[k])
        k -= 1


def exp2():
    start = 10
    end = 99
    idx = -1
    while True:
        mn = 1e20
        for i in range(start, end + 1):
            res = T(i)
            if res < mn:
                mn = res
                idx = i
        print("start, end, mn, idx = {}, {}, {}, {}".format(start, end, mn, idx))
        start *= 10
        end = end * 10 + 9

def exp3():
    MAX = 10000
    ans = [None] * MAX

    for i in range(1000, 9999):
        num_str = str(i) + '999999999'
        num = int(num_str)
        ans[i] = T(i)

    print(ans)
    
    mins = [None] * MAX
    k = 9998
    mins[k] = ans[k]
    k -= 1
    while k >= 1000:
        if (ans[k] <= mins[k+1]):
            print("{} is answer".format(k))
        mins[k] = min(mins[k+1], ans[k])
        k -= 1

        # mytest(num)


# exp1()
# exp2()
# exp3()

ans = list(range(1, 10))
for i in range(19, 100, 10):
    ans.append(i)
for i in range(199, 1000, 100):
    ans.append(i)

nine = '99'
to = 19
while ans[-1] < 10000000000000000:
    for i in range(10, to):
        tmp = int(str(i) + nine)
        ans.append(tmp)
    for j in range(to, 100, 10):
        tmp = int(str(j) + nine)
        ans.append(tmp)

    nine += '9'
    
    to += 10
    if to > 99:
        to = 19

# # 適当
# while ans[-1] < 10000000000000000:
#     ans.append(ans[-1] * 10 + 9)

# for a in ans:
#     print(a)
    
# def mytest(k):
#     print("{}/S({}) = {}".format(k, k, k / S(k)))

# mytest(1000000000000)
# mytest(1099999999999)
# mytest(1009999999999)
# mytest(1019999999999)
# mytest(1029999999999)
# mytest(9999999999999)

    
K = int(input())
ans = ans[:K]
for a in ans:
    print(a)

Submission status: Wrong Answer

Solution code:
def digit_sum(a):
    res = 0
    while a:
        res += a % 10
        a /= 10
        a = int(a)
    return res

def main():

    d = {}
    MAX = 10**17
    for i in range(18):
        for j in range(100):
            if i == 0 and j == 0: continue
            tmp = int(str(j) + str(9) * i)
            if tmp > MAX: continue
            d[tmp] = tmp / digit_sum(tmp)

    ls = []
    for a, b in d.items():
        ls.append([b, a])
    ls.sort()

    ls.append([0, MAX])

    k = int(input())

    idx, last = 0, 0
    while k:
        while ls[idx][1] < last: idx += 1
        print(ls[idx][1])
        k -= 1
        last = ls[idx][1]
        idx += 1

    """while True:
        k = int(input())
        if k == 0:
            return True
        print(">", k / digit_sum(k))
    """

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def main():
    maxi = 0
    k = int(input())
    for i in range(16):
        for j in range(1, 10 * i):
            tmp = int(str(j) + str('9' * i))
            if maxi < tmp:
                maxi = tmp
            else:
                continue
            k -= 1
            print(tmp)
            if not k:
                return
        maxi = [int(i) for i in str(maxi)]
        while maxi[0] < 9:
            maxi[0] += 1
            k -= 1
            print("".join(map(str, maxi)))
            if not k:
                return
        maxi = int("".join(map(str, maxi)))
        # for j in range(i, 10):
        #     if i <= 1:
        #         break
        #     tmp = int(str(j) + str('9' * (2 * i - 1)))
        #     if maxi < tmp:
        #         maxi = tmp
        #     else:
        #         continue
        #     k -= 1
        #     print(tmp)


main()

Submission status: Wrong Answer

Solution code:
k = int(input())
s = 0
a = []
for i in range(1,k+1):
    if i % 9:
        ans = str(i%9) + "9" * (i//9)
    else:
        ans = "9" * (i//9)
    if (i+1) % 9:
        next_ans = str((i+1)%9) + "9" * ((i+1)//9)
    else:
        next_ans = "9" * ((i+1)//9)
    if (int(ans) / i) <= (int(next_ans) / (i+1)):
        print(ans)
    s += 1
    if s == k:
        quit()
    if i < 10:
        continue
    if i % 9:
        ans = str(i%9 + 1) + "8" + "9" * (i//9 - 1)
    else:
        ans = "1" + "8" + "9" * (i//9 - 1)
    if (int(ans) / i) <= (int(next_ans) / (i+1)):
        print(ans)
        s += 1
    if s == k:
        quit()

Submission status: Wrong Answer

Solution code:
from sys import stdin 
c =[1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 29, 39, 49, 59, 69, 79, 89, 99, 199, 299, 399, 499, 599, 699, 799, 899, 999, 1999, 2999, 3999, 4999, 5999, 6999, 7999, 8999, 9999, 19999, 29999, 39999, 49999, 59999, 69999, 79999, 89999, 99999, 199999, 299999, 399999, 499999, 599999, 699999, 799999, 899999, 999999, 1999999, 2999999, 3999999, 4999999, 5999999, 6999999, 7999999, 8999999, 9999999, 19999999, 29999999, 39999999, 49999999, 59999999, 69999999, 79999999, 89999999, 99999999, 199999999, 299999999, 399999999, 499999999, 599999999, 699999999, 799999999, 899999999, 999999999, 1999999999, 2999999999, 3999999999, 4999999999, 5999999999, 6999999999, 7999999999, 8999999999, 9999999999, 19999999999, 29999999999, 39999999999, 49999999999, 59999999999, 69999999999, 79999999999, 89999999999, 99999999999, 199999999999, 299999999999, 399999999999, 499999999999, 599999999999, 699999999999, 799999999999, 899999999999, 999999999999, 1999999999999, 2999999999999, 3999999999999, 4999999999999, 5999999999999, 6999999999999, 7999999999999, 8999999999999, 9999999999999, 19999999999999, 29999999999999, 39999999999999, 49999999999999, 59999999999999, 69999999999999, 79999999999999, 89999999999999, 99999999999999, 199999999999999, 299999999999999, 399999999999999, 499999999999999, 599999999999999, 699999999999999, 799999999999999, 899999999999999, 999999999999999, 1999999999999999]
n = int(stdin.readline())
c = set(c)
c = list(c)
c.sort()
c = c[:n] 
for i in c:
    print i 
if n > 808:
    while True:
        xx = 3