{"problem":{"name":"Increasing Numbers","description":{"content":"We will call a non-negative integer _increasing_ if, for any two adjacent digits in its decimal representation, the digit to the right is greater than or equal to the digit to the left. For example, $","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"agc011_e"},"statements":[{"statement_type":"Markdown","content":"We will call a non-negative integer _increasing_ if, for any two adjacent digits in its decimal representation, the digit to the right is greater than or equal to the digit to the left. For example, $1558$, $11$, $3$ and $0$ are all increasing; $10$ and $20170312$ are not.\nSnuke has an integer $N$. Find the minimum number of increasing integers that can represent $N$ as their sum.\n\n## Constraints\n\n*   $1 \\leq N \\leq 10^{500000}$\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"agc011_e","tags":[],"sample_group":[["80","2\n\nOne possible representation is $80 = 77 + 3$."],["123456789","1\n\n$123456789$ in itself is increasing, and thus it can be represented as the sum of one increasing integer."],["20170312","4"],["7204647845201772120166980358816078279571541735614841625060678056933503","31"]],"created_at":"2026-03-03 11:01:13"}}