-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path517-expensive-number.cpp
More file actions
37 lines (36 loc) · 846 Bytes
/
Copy path517-expensive-number.cpp
File metadata and controls
37 lines (36 loc) · 846 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
/*
* Expensive Number [2093B]
* Problem: https://codeforces.com/problemset/problem/2093/B
* Verdict: ACCEPTED Solved: 2025-04-29
* Language: C++23 (GCC 14-64, msys2)
* Runtime: 46 ms Memory: 0 KB
* Tags: greedy, math
* Author: BidoTeima
* Source: https://codeforces.com/contest/2093/submission/317748990
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t--){
string s;
cin>>s;
int n = (int)s.size();
int cntz=0;
int ans = n - 1;
for(int i = 0; i < n; i++){
if(s[i]!='0'){
ans = min(ans, n - (cntz + 1));
}
else cntz++;
}
cout << ans << '\n';
}
return 0;
}