zoukankan      html  css  js  c++  java
  • codeforces A. Wrong Subtraction

    A. Wrong Subtraction
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard 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 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 (2n1092≤n≤109, 1k501≤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.

    Examples
    input
    Copy
    512 4
    output
    Copy
    50
    input
    Copy
    1000000000 9
    output
    Copy
    1
    Note

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

    基础程序设计。

    AC代码:

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

     

  • 相关阅读:
    Java日历表
    递归实现文件的大小计算
    将机器学习的个性化推荐与社会化机制相结合
    设计模式——抽象工厂模式
    从mysql到nosql
    设计模式——Adapter模式(变压器)
    Java 正则匹配
    对象集合转换为datatable
    sql1
    Oracle Index 相關知識
  • 原文地址:https://www.cnblogs.com/godoforange/p/10944189.html
Copyright © 2011-2022 走看看