Stones on the Table

Text Reverse

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.

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

问题简述：该题就是判断相同的字母有多少个，然后再减一。

程序简述：先建立一个字符数组，再输入字符串，然后用循环比较每一个字符数组是否与下一个相同，最后记录相同字母的个数。

#include <iostream>
using namespace std;
int main()
{
 int a,i;
 int n = 0;
 cin >> a;
 char*s = new char[a];
 cin >> s;
 for (i = 0; s[i] != '\0'; i++)
 {
  if (s[i] == s[i + 1])
   n++;
 }
 cout << n;
}