Polycarp is crazy about round numbers. He especially likes the numbers divisible by 10k.
In the given number of n Polycarp wants to remove the least number of digits to get a number that is divisible by 10k. For example, if k = 3, in the number 30020 it is enough to delete a single digit (2). In this case, the result is 3000 that is divisible by 103 = 1000.
Write a program that prints the minimum number of digits to be deleted from the given integer number n, so that the result is divisible by 10k. The result should not start with the unnecessary leading zero (i.e., zero can start only the number 0, which is required to be written as exactly one digit).
It is guaranteed that the answer exists.
The only line of the input contains two integer numbers n and k (0 ≤ n ≤ 2 000 000 000, 1 ≤ k ≤ 9).
It is guaranteed that the answer exists. All numbers in the input are written in traditional notation of integers, that is, without any extra leading zeros.
Print w — the required minimal number of digits to erase. After removing the appropriate w digits from the number n, the result should have a value that is divisible by 10k. The result can start with digit 0 in the single case (the result is zero and written by exactly the only digit 0).
30020 3
1
100 9
2
10203049 2
3
In the example 2 you can remove two digits: 1 and any 0. The result is number 0 which is divisible by any number.
题目大意:n能整除10的k次方所需删除数的最少个数
思路:让数的末尾有k个0就行了,倒着数不是0就删除,直到0的个数与k相等。当时为考虑删完后全是0的情况,结果FST了,wa在101010110 5
#include<bits/stdc++.h>
using namespace std;
int main()
{
char s[100];
int k;
scanf("%s%d",s,&k);
int l=strlen(s);
if(l-1<k){
printf("%d\n",l-1);
return 0;
}
int num=0,ans=0,i;
for (i=l-1; i>=0; i--){
if(s[i]!='0') ans++;
else num++;
if(num==k) break;
}
if(i==-1) printf("%d\n",l-1); //删完后全是0
else printf("%d\n",ans);
return 0;
}