{"problem":{"name":"Snuke Numbers","description":{"content":"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 t","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc099_b"},"statements":[{"statement_type":"Markdown","content":"Let $S(n)$ denote the sum of the digits in the decimal notation of $n$. For example, $S(123) = 1 + 2 + 3 = 6$.\nWe 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.\nGiven an integer $K$, list the $K$ smallest Snuke numbers.\n\n## Constraints\n\n*   $1 \\leq K$\n*   The $K$\\-th smallest Snuke number is not greater than $10^{15}$.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$K$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc099_b","tags":[],"sample_group":[["10","1\n2\n3\n4\n5\n6\n7\n8\n9\n19"]],"created_at":"2026-03-03 11:01:13"}}