CF 977A Wrong Subtraction

题目地址：http://codeforces.com/problemset/problem/977/A
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
inputCopy
512 4
outputCopy
50
inputCopy
1000000000 9
outputCopy
1
Note
The first example corresponds to the following sequence: 512→511→510→51→50.
题目大意：对一个数字进行变换，如果个位数不是0就减一，是0就除10，输入数字N 和变换的次数，输出最后的结果。
解题思路：模拟

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