Wrong Subtraction

一、Wrong Subtraction

本题链接：Wrong Subtraction

题目：
A. Wrong Subtraction
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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:

if the last digit of the number is non-zero, she decreases the number by one;
if the last digit of the number is zero, she divides the number by 10 (i.e. removes the last digit).
You 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.

It is guaranteed that the result will be positive integer number.

Input
The first line of the input contains two integer numbers n and k (2≤n≤109, 1≤k≤50) — the number from which Tanya will subtract and the number of subtractions correspondingly.

Output
Print one integer number — the result of the decreasing n by one k times.

It is guaranteed that the result will be positive integer number.

Examples

input
512 4
output
50

input
1000000000 9
output
1

Note
The first example corresponds to the following sequence: 512→511→510→51→50.

本博客给出本题截图：

题意：输入n和k，把一个数按照如果各位是0就减1，否则除以10，求k次操作后得到的值为多少
AC代码

#include <iostream>using namespace std;int main()
{
    int n, k;cin >> n >> k;for (int i = 0; i < k; i ++ )if (n % 10) n --;else n /= 10;cout << n << endl;return 0;
}

总结

水题，不解释