Submission #1248133

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long int ll;
const ll MOD (1e9+7);
const ll INF (2e9);
const int MAX_N (200001);

int main(void) {
    char *s=new char[100005];
    cin>>s;
    int ans=0;
    // cout<<s[0]<<s[1]<<"a"<<s[2]<<"A";
    for(int i=0;s[i+1]!='\0';i++){
        // cout<<i;
        if(s[i]!=s[i+1]){
            ans++;
        }
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result