You are given a string ss. Each character is either 0 or 1.

You want all 1’s in the string to form a contiguous subsegment. For example, if the string is 0, 1, 00111 or 01111100, then all 1’s form a contiguous subsegment, and if the string is 0101, 100001 or 11111111111101, then this condition is not met.

You may erase some (possibly none) 0’s from the string. What is the minimum number of 0’s that you have to erase?

Input
The first line contains one integer tt (1≤t≤1001≤t≤100) — the number of test cases.

Then tt lines follow, each representing a test case. Each line contains one string ss (1≤|s|≤1001≤|s|≤100); each character of ss is either 0 or 1.

Output
Print tt integers, where the ii-th integer is the answer to the ii-th testcase (the minimum number of 0’s that you have to erase from ss).

Example
Input
3
010011
0
1111000
Output
2
0
0
Note
In the first test case you have to delete the third and forth symbols from string 010011 (it turns into 0111).
水題一個。
代碼如下：

#include<bits/stdc++.h> #define ll long long using namespace std;string s;int main() {int t;scanf("%d",&t);while(t--){cin>>s;int sum=0;int x=-1,y=-1;for(int i=0;i<s.length();i++){if(s[i]=='1') {x=i;break;}}for(int j=s.length()-1;j>=0;j--){if(s[j]=='1'){y=j;break;}}if(x==-1||y==-1) cout<<0<<endl;else {for(int i=x;i<=y;i++){if(s[i]=='0') sum++;}cout<<sum<<endl;}}return 0; }

努力加油a啊，(^o)/~

總結

以上是生活随笔為你收集整理的Erasing Zeroes CodeForces - 1303A的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。