CodeForces - 266A Stones on the Table 【水题】

**

CodeForces - 266A Stones on the Table 【水题】

**
266A Stones on the Table

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.

Examples
Input

 3
RRG

Output

   1

Input

5
RRRRR

Output

 4

Input

4
BRBG

Output

    0

问题链接：https://vjudge.net/problem/CodeForces-266A
问题描述：
桌子上有n块石头，每一块都可以是红的、绿的或蓝的。计算要从表中取出的石头的最小数目，以便任何两个相邻的石头具有不同的颜色。如果没有其他石头，一排石头被认为是相邻的。

问题分析：
定义一个变量保存两个相邻石头相同的次数。

程序说明：
定义动态字符数组，输入石头的个数以确定字符的个数，用while循环逐个比较，记下相邻石头颜色相同的个数。

AC通过的c++程序如下

#include <iostream>
using namespace std;
int main()
{
	
	int n;
	int c=0;
	cin >> n;
	char *s = new char[n];
	cin >> s;
	--n;
	while (n > 0)
	{
		if (s[n] == s[n-1])
			c++;
		--n;
	}
	cout << c;

   
}