Codeforces Round #402 (Div. 2) B题

B. Weird Rounding

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Polycarp is crazy about round numbers. He especially likes the numbers divisible by10^k.

In the given number of n Polycarp wants to remove the least number of digits to get a number that is divisible by10^k. For example, ifk = 3, in the number 30020 it is enough to delete a single digit (2). In this case, the result is3000 that is divisible by 10³ = 1000.

Write a program that prints the minimum number of digits to be deleted from the given integer numbern, so that the result is divisible by 10^k. The result should not start with the unnecessary leading zero (i.e., zero can start only the number0, which is required to be written as exactly one digit).

It is guaranteed that the answer exists.

Input

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.

Output

Print w — the required minimal number of digits to erase. After removing the appropriatew digits from the number n, the result should have a value that is divisible by 10^k. The result can start with digit0 in the single case (the result is zero and written by exactly the only digit0).

Examples

Input

30020 3

Output

1

Input

100 9

Output

2

Input

10203049 2

Output

3

Note

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和k，问在n中至少删掉多少个数字，可以使其被10的k次方整除，一定保证解的存在。

解法：直接从后向前扫描，记录扫描到几个0，不是0的话答案就要加一，0的个数达到k个就可以终止，如果扫描完不足k个零那么答案就是原长度减一

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char str[15];
int k;
int main()
{
    scanf("%s %d",str+1,&k);
    int len=strlen(str+1);
    if(len<k+1){
        printf("%d\n",len-1);
    }else if(len==k+1){
        int flag=0;
        for(int i=len;i>=2;i--){
            if(str[i]!='0') flag=1;
        }
        if(flag)printf("%d\n",len-1);
        else printf("0\n");
    }else{
        int cnt0=0;
        int ans=0;
        for(int i=len;i>=1;i--){
            if(str[i]=='0')cnt0++;
            else ans++;
            if(cnt0==k)break;
        }
        printf("%d\n",ans);
    }
    return 0;
}