{"problem":{"name":"Broken Rounding","description":{"content":"Given a non-negative integer $X$, perform the following operation for $i=1,2,\\dots,K$ in this order and find the resulting $X$. *   Round $X$ off to the nearest $10^i$.     *   Formally, replace $X$ ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc273_b"},"statements":[{"statement_type":"Markdown","content":"Given a non-negative integer $X$, perform the following operation for $i=1,2,\\dots,K$ in this order and find the resulting $X$.\n\n*   Round $X$ off to the nearest $10^i$.\n    *   Formally, replace $X$ with $Y$ that is \"the largest multiple of $10^i$ that minimizes $|Y-X|$.\"\n    *   Here are some examples:\n        *   Rounding $273$ off to the nearest $10^2$ yields $300$.\n        *   Rounding $999$ off to the nearest $10^3$ yields $1000$.\n        *   Rounding $100$ off to the nearest $10^{10}$ yields $0$.\n        *   Rounding $1015$ off to the nearest $10^1$ yields $1020$.\n\n## Constraints\n\n*   $X$ and $K$ are integers.\n*   $0 \\le X < 10^{15}$\n*   $1 \\le K \\le 15$\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$X$ $K$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc273_b","tags":[],"sample_group":[["2048 2","2100\n\n$X$ changes as $2048 \\rightarrow 2050 \\rightarrow 2100$ by the operations."],["1 15","0"],["999 3","1000"],["314159265358979 12","314000000000000\n\n$X$ may not fit into a $32$\\-bit integer type."]],"created_at":"2026-03-03 11:01:14"}}