#include<bits/stdc++.h>
using namespace std;
const int N=1e3;
const int M=2e5;
const int mod=998244353;
const int INF=0x3f3f3f3f;
int n,v[N+5];
char ch[N+5];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n>>(ch+1);
int ans1=0,ans2=0;
for(int i=1;i<=n;i++){
char c=((i&1)?'1':'0');
v[i]=(c!=ch[i]);
}
for(int i=1;i<=n;i++)ans1+=v[i];
for(int i=1;i<=n;i++){
char c=((i&1)?'0':'1');
v[i]=(c!=ch[i]);
}
for(int i=1;i<=n;i++)ans2+=v[i];
cout<<min(ans1,ans2);
return 0;
}
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |