Stones on the Table CodeForces - 266A

There are n stones on the table in a row, each of them can be red, green or blue. Count the minimum number of stones to take from the table so that any two neighboring stones had different colors. Stones in a row are considered neighboring if there are no other stones between them.

    Input
    The first line contains integer n (1 ≤ n ≤ 50) — the number of stones on the table. 

The next line contains string s, which represents the colors of the stones. We’ll consider the stones in the row numbered from 1 to n from left to right. Then the i-th character s equals “R”, if the i-th stone is red, “G”, if it’s green and “B”, if it’s blue.

    Output
    Print a single integer — the answer to the problem.

    Examples

Input

3
RRG

Output

1

Input

5
RRRRR

Output

4

Input

4
BRBG

Output

0

问题链接

问题简述：一排红绿蓝三种颜色的石头，拿走最少的石头数，使相邻石头不同颜色，输出这个数
问题分析：1.判断有多少组相邻的石头相同颜色 2.用一个数记录这组数据

以下为程序代码

#include<iostream>
using namespace std;
int main()
{
 int n,i,k=0;char b[10];
 cin>>n>>b;
 while(n--) 
 {
 if(b[n]==b[n-1])
 {
  k++;}
 }
 cout<<k;
 }