A Sumo and Keyboard-Cat

题目地址：

https://ac.nowcoder.com/acm/contest/5954/A

基本思路：

签到题。直接模拟过程，遇到要切换的就切换一下，计算切换次数，注意初始是大写状态。

参考代码：

#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
#define IO std::ios::sync_with_stdio(false)
#define int long long
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define per(i, l, r) for (int i = l; i >= r; i--)
#define mset(s, _) memset(s, _, sizeof(s))
#define pb push_back
#define pii pair <int, int>
#define mp(a, b) make_pair(a, b)
#define INF (int)1e18

inline int read() {
  int x = 0, neg = 1; char op = getchar();
  while (!isdigit(op)) { if (op == '-') neg = -1; op = getchar(); }
  while (isdigit(op)) { x = 10 * x + op - '0'; op = getchar(); }
  return neg * x;
}
inline void print(int x) {
  if (x < 0) { putchar('-'); x = -x; }
  if (x >= 10) print(x / 10);
  putchar(x % 10 + '0');
}

string str;
signed main() {
  IO;
  cin >> str;
  int f = 1,cnt = 0;
  for(auto it : str){
    int k = 0;
    if(it >= 'A' && it <= 'Z') k = 1;
    if(k != f) f = k,cnt++;
  }
  cout << cnt << '\n';
  return 0;
}