{"problem":{"name":"A. Wrong Subtraction","description":{"content":"Little girl Tanya is learning how to decrease a number by one, but she does it wrong with a number consisting of two or more digits. Tanya subtracts one from a number by the following algorithm: *   ","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF977A"},"statements":[{"statement_type":"Markdown","content":"Little girl Tanya is learning how to decrease a number by one, but she does it wrong with a number consisting of two or more digits. Tanya subtracts one from a number by the following algorithm:\n\n*   if the last digit of the number is non-zero, she decreases the number by one;\n*   if the last digit of the number is zero, she divides the number by 10 (i.e. removes the last digit).\n\nYou are given an integer number $n$. Tanya will subtract one from it $k$ times. Your task is to print the result after all $k$ subtractions.\n\nIt is guaranteed that the result will be positive integer number.\n\n## Input\n\nThe first line of the input contains two integer numbers $n$ and $k$ ($2 \\le n \\le 10^9$, $1 \\le k \\le 50$) — the number from which Tanya will subtract and the number of subtractions correspondingly.\n\n## Output\n\nPrint one integer number — the result of the decreasing $n$ by one $k$ times.\n\nIt is guaranteed that the result will be positive integer number.\n\n[samples]\n\n## Note\n\nThe first example corresponds to the following sequence: $512 \\rightarrow 511 \\rightarrow 510 \\rightarrow 51 \\rightarrow 50$.","is_translate":false,"language":"English"}],"meta":{"iden":"CF977A","tags":["implementation"],"sample_group":[["512 4","50"],["1000000000 9","1"]],"created_at":"2026-03-03 11:00:39"}}