Submission #2094941

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <cstdlib>
#include <cmath>
#include <functional>
#include <queue>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <stack>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fst first
#define snd second
const ll mod = 1000000007;
const ll INF = (1LL << 59);
const double dINF = 1000000000000000000.0;

int main(){
	string str;
	cin >> str;
	char tmp=str[0];
	int ans = 0;
	for (auto &&c : str) {
		if (c != tmp)ans++;
		tmp = c;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result