C++ 齿轮问题：静态数组解法 - TopCoder SRM 589

#include <iostream>
#include <string>

using namespace std;

int main() {
    int n;
    cin >> n;
    
    string directions;
    cin >> directions;
    
    int count = 0;
    
    for (int i = 0; i < n; i++) {
        // 检查当前齿轮与其相邻齿轮的方向是否相同
        if (directions[i] == directions[(i+1)%n] || directions[i] == directions[(i-1+n)%n]) {
            count++;
        }
    }
    
    cout << count << endl;
    
    return 0;
}