Stones on the Table

题目网址： http://codeforces.com/problemset/problem/266/A

Stones on the Table

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

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

Sample test(s)

input

3
RRG

output

1

input

5
RRRRR

output

4

input

4
BRBG

output

0

题意：就是从左往右放石头，但是不能让相同颜色的石头相邻，相邻的石头就移除，问要移除几个石头。

很简单的一题，但是一开始没看懂题意，以为是问最少移动几次使相邻石头颜色不同。

注意，不要认为最后一个和第一个颜色也要不同，这不是环。

AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

int main()
{
    int n,i,sum;
    char s[55];
    while(scanf("%d",&n)!=EOF)
    {
        sum = 0;       //移除石头数量
        scanf("%s",&s);
        for(i = 0; i < n; i++)
        {
            if(s[i] == s[i+1])   //判断当前的和后面的颜色是否相同，相同则移除
            {
                sum++;
            }
        }
        printf("%d\n",sum);
    }

    return 0;
}