143482025-01-10 17:05:15bzyTakaros Sorozat (80 pont)cpp17Wrong answer 38/804ms756 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
    int n; cin >> n;
    string binary; cin >> binary;
    int ending =n-1;
    int start = 0;
    while(binary[ending] == '1' && ending >= 0) ending--;
    while(binary[start] == '0' && start < n) start++;
    int zeros = 0;
    for(int i = start; i <= ending; i++)
    {
        if(binary[i] == '0') zeros++;
    }
    if(ending < start) {
        cout << 0 << "\n" << 0;
        return 0;
    }
    else{
        cout << min(ending - start + 1 - zeros, zeros) << "\n";
    }

	return 0;
}
SubtaskSumTestVerdictTimeMemory
base38/80
1Wrong answer0/01ms512 KiB
2Wrong answer0/04ms564 KiB
3Accepted4/41ms316 KiB
4Partially correct2/41ms316 KiB
5Partially correct2/41ms396 KiB
6Partially correct2/41ms316 KiB
7Partially correct2/41ms316 KiB
8Partially correct2/41ms316 KiB
9Partially correct2/41ms316 KiB
10Partially correct2/41ms500 KiB
11Partially correct2/41ms316 KiB
12Partially correct2/41ms508 KiB
13Accepted4/43ms564 KiB
14Partially correct2/43ms564 KiB
15Partially correct2/43ms604 KiB
16Partially correct2/43ms564 KiB
17Partially correct2/43ms564 KiB
18Partially correct2/43ms756 KiB
19Partially correct2/43ms508 KiB
20Wrong answer0/44ms592 KiB
21Wrong answer0/43ms616 KiB
22Wrong answer0/44ms568 KiB