← 返回题目

题库练习 Stones on the Table

← 上一题下一题 →

A8782 | $Stones on the Table$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

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.

输入格式

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.

输出格式

Print a single integer — the answer to the problem.

输入输出样例

输入 #1

3
RRG

输出 #1

输入 #2

5
RRRRR

输出 #2

输入 #3

4
BRBG

输出 #3

C++ 编辑器

输入

输出