CodeForces A. Wrong Subtraction

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 nn. Tanya will subtract one from it kk times. Your task is to print the result after all kk subtractions.

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

Input

The first line of the input contains two integer numbers nn and kk (2≤n≤1092≤n≤109, 1≤k≤501≤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 nn by one kk times.

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

题目大意：给一个数字a以及一个操作数n，将这个数字a进行操作n次，输出最后的结果

进行的操作：如果最后一个数字不是0就减去1，否则就将这个数字整除10；

JAVA代码：

import java.util.*;
public class fun {
    public static void main(String args[]){
        int a=0,b=0;
        Scanner read = new Scanner(System.in);
        a = read.nextInt();
        b = read.nextInt();
        while(b-->0){
            if(a%10!=0) a-=1;
            else a/=10;
        }
        System.out.println(a);
    }
}