Submission #1842833

---

Source Code Expand

#include<bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
int get(int s){
  set<int>st;
  while(s)st.insert(s%10),s/=10;
  return st.size()==1;
}
int main(){
  string s;
  cin>>s;
  stack<char>st;
  st.push(s[0]);
  r(i,s.size()-1){
    if(st.top()==s[i+1])continue;
    st.push(s[i+1]);
  }
  cout<<st.size()-1<<endl;
}

Submission Info

Judge Result