Stones on the Table

文章目录

一、Stones on the Table

总结

一、Stones on the Table

本题链接：Stones on the Table

题目：

A. 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

input

3

RRG

output

1

input

5

RRRRR

output

4

input

4

BRBG

output

0

本博客给出本题截图：

题意：判断有多少个相邻的相同的色块。

AC代码

#include <iostream>
using namespace std;
const int N = 60;
char s[N];
int res; 
int main()
{
  int n;
  cin >> n;
  for (int i = 0; i < n; i ++ ) cin >> s[i];
  for (int i = 0; i < n - 1; i ++ )
    if (s[i] == s[i + 1]) 
      res ++;
  cout << res << endl;
  return 0;
}

总结

水题，不解释