[백준 1439] 뒤집기 (C/C++)

#include <stdio.h>
#include <iostream>
#include <set>
#include <map>
#include <queue>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
using namespace std;
 
string s;
int cnt0, cnt1;
 
int main(void)
{
//    freopen("B1439_input.txt", "r", stdin);
    
    cin >> s;
    
    for(int i = 0; i < s.size(); i++)
    {
        if(s[i] == '1' && s[i] != s[i+1])
        {
            cnt1++;
        }
        else if(s[i] == '0' && s[i] != s[i+1])
        {
            cnt0++;
        }
    }
    
    cout << min(cnt1, cnt0);
    
    return 0;
}