codeforces 266A

就是找相邻字母相同的个数

 

#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdlib>

using namespace std;

vector < char > vec;
char x;
 
int main ( ) {
    int i, ans, Case;
    cin >> Case;
    ans = 0;
    for ( i = 1; i <= Case; ++i ) {
        cin >> x;
        vec.push_back ( x );
    }
    for ( i = 0; i < Case; ++i ) 
        if ( vec[i] == vec[i + 1] ) ans++;
    cout << ans << endl;
    //system ( "pause" );
}