Submission #3426386

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<map>
#include<list>
#include<set>
using namespace std;

int cnt=0;
int len=0;
int now=0;
int main(){
  char s[100001];
  int re[100001];
  cin >> s;

  len = strlen(s);

  for(int i=0;i<len;i++){
    if(s[i] == 'W'){
      re[i] = 1;
    }else{
      re[i] = 0;
    }
  }

  now = re[0];

  for(int i=0;i<len;i++){

    if(now!=re[i]){
      now = (now+1)%2;
      cnt++;
      }
  }

  cout << cnt << endl;

  return 0;
}

Submission Info

Judge Result