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

Stones on the Table

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output

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
inputCopy
3
RRG
outputCopy
1
inputCopy
5
RRRRR
outputCopy
4
inputCopy
4
BRBG
outputCopy
0

问题链接：https://vjudge.net/problem/CodeForces-266A。

问题简述：输入石头数量n，以及石头的颜色排序。计算最少拿走几颗石头使到相邻的两颗石头颜色不相同。

问题分析：该最小值等于共有多少颗相邻且颜色相同的石头。

程序说明：声明一个大小为 50 的数组存放颜色字符，当两颗相同颜色的石头相连时，即计算数组中前一个元素跟后一个元素相等if (s[i] == s[i + 1])的次数。

AC通过的C语言程序如下

#include <iostream>
using namespace std;
int main()
{
	int n, i;
	char s[50];	
	while(cin >> n)
	{
		cin >> s;
	int j = 0;
	for (i = 0; i < n; i++)
	{
		if (s[i] == s[i + 1])
		{
			j++;
		}
	}
	cout << j;
	}
}