n,k = input().split()
k = int(k)
length = len(n)-1
count = 0
while length >= 0 and k:
if n[length] == "0":
k -= 1
else:
count += 1
length -= 1
if k:
print(len(n)-1)
else:
print(count)
//Je Cruis En Moi
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e3 + 10;
pair <int, int> t[MAXN];
int main () {
int k, ans = 0, x = 0, m = 0;
string n;
cin >> n >> k;
for (int i = 0; i <= (int)n.size() - 1; i ++) {
if (n[i] == '0')
m ++;
}
if (m < k) {
if (m == 0)
cout << 0 << endl;
else
cout << (int)n.size() - 1 << endl;
return 0;
}
for (int i = (int)n.size() - 1; i >= 0; i --) {
if (n[i] == '0')
x ++;
//cout << i << " " <<x << endl;
if (x == k) {
cout << (((int)n.size() - i) - x);
return 0;
}
}
return 0;
}
1702C - Train and Queries | 816B - Karen and Coffee |
838D - Airplane Arrangements | 148B - Escape |
847G - University Classes | 1110A - Parity |
1215B - The Number of Products | 604C - Alternative Thinking |
1204C - Anna Svyatoslav and Maps | 322A - Ciel and Dancing |
1689B - Mystic Permutation | 1711B - Party |
1702D - Not a Cheap String | 1714F - Build a Tree and That Is It |
1703F - Yet Another Problem About Pairs Satisfying an Inequality | 610A - Pasha and Stick |
1200A - Hotelier | 1091A - New Year and the Christmas Ornament |
1352B - Same Parity Summands | 1102A - Integer Sequence Dividing |
630B - Moore's Law | 1004A - Sonya and Hotels |
1680B - Robots | 1690A - Print a Pedestal (Codeforces logo) |
1295A - Display The Number | 1077A - Frog Jumping |
1714G - Path Prefixes | 1369C - RationalLee |
289B - Polo the Penguin and Matrix | 1716A - 2-3 Moves |