Stones on the Table CodeForces - 266A

Stones on the Table CodeForces - 266A

Time limit：2000 ms Memory limit：262144 kB
Source：Codeforces Round #163 (Div. 2)
Tag：simplementation *800
Editorial：Announcement Tutoria
Problem Description：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.

Sample Input：
3
RRG

Sample Output：1

Sample Input：

5
RRRRR

Sample Output：4

Sample Input：

4
BRBG

Sample Output：0

问题链接：Stones on the Table CodeForces - 266A
问题简述：有一排彩色的石头，问最少拿走几个时，每两个相邻的石头颜色不同。
问题分析：自己多写几个不同的序列，通过比较分析得出：当每两个相邻的颜色相同的石头拿掉其中一个时，拿的次数最少。
AC代码如下：

#include <iostream>
using namespace std;
int main()
{
	int n;
	char a[51];
	while (cin >> n)
	{
		int m, count = 0;
		cin >> a;
		for (m = 0; m < n; m++)
		{
			if (a[m] == a[m + 1])//当相邻两个石头颜色相同时，取出一个，次数加一
				count++;
		}
		cout << count << endl;
	}
}