codeforces 977A Wrong Subtraction

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

原创最新推荐文章于 2024-05-20 21:30:49 发布 · 355 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#水题

ACM算法_水题专栏收录该内容

76 篇文章

订阅专栏

本文介绍了一个关于数字减法的简单算法问题。题目描述了小女孩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 \leq n \leq 10^{9}$ , $1 \leq k \leq 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
         
          Copy
         
512 4

         output
         
          Copy
         
50

         input
         
          Copy
         
1000000000 9

         output
         
          Copy
         
1

Note

The first example corresponds to the following sequence: $512 \to 511 \to 510 \to 51 \to 50$ .

水题

#include<bits/stdc++.h>

using namespace std;

int main()
{
    int n,k;
    cin>>n>>k;
    while(k--)
    {
        int w=n%10;
        if(w!=0)
        {
            n--;
        }
        else
        {
            n/=10;
        }
        //printf("##  %d\n",n);
    }
    cout<<n<<endl;
    return 0;
}