CodeForces 977A Wrong Subtraction 水题

最新推荐文章于 2024-05-20 21:30:49 发布

yhwqeioyqewqiweq

最新推荐文章于 2024-05-20 21:30:49 发布

阅读量309

点赞数

CC 4.0 BY-SA版权

分类专栏： CF 文章标签：水

本文链接：https://blog.youkuaiyun.com/qq_41333002/article/details/80738810

CF 专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一种特殊的减数算法，由角色Tanya使用。该算法规定如果一个数的末位非零，则减一；若为零，则除以十（即去掉末位）。文章通过一个示例程序展示了如何实现这一算法，并给出了输入输出样例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Input

1000000000 9

Output

Note

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

这种题写题解太累了

AC代码：

#include <iostream>

using namespace std;

int main()
{
    int n,k;
    while(cin>>n>>k)
    {
        while(k--)
        {
            if(n%10==0) n/=10;
            else n--;
        }
        cout<<n<<endl;
    }
    return 0;
}