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
问题简述：
桌子上有一行石头，石头的颜色有红色 蓝色 和绿色，请拿掉最少数量的石头，使得每个石头相邻的颜色都不一样，就算拿掉的石头数。
问题分析：
前一个石头跟后一个石头比较颜色，设置一个变量j记录颜色相同的次数，有多少次颜色相同就要拿掉多少个石头。
程序说明：
得到石头数后，申请一个动态数组存放代表颜色的字符，用for循环比较前一个和后一个石头的颜色，用j记录。
程序实现：

#include "pch.h"
#include <iostream>
using namespace std;
int main()
{
 int n,j=0;
 cin >> n;
 while (n < 1 || n>50)
 {
  cout << "输入错误，请重新输入" << endl;
  cin >> n;
 }
 char*color = new char[n];
 cin >> color;
 for (int i = 0; i < n-1; i++)
 {
  if (color[i] == color[i + 1])
   j += 1;
 }
 cout << j;
 delete color;
 
}