codeforces 266A Stones on the Table（模拟水题）

96 阅读 0 评论 64 点赞

我是靠谱客的博主谨慎毛巾，这篇文章主要介绍codeforces 266A Stones on the Table（模拟水题），现在分享给大家，希望可以做个参考。

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

复制代码

1
2
3
RRG

Output

复制代码

1
1

Input

复制代码

1
2
5
RRRRR

Output

复制代码

1
4

Input

复制代码

1
2
4
BRBG

Output

复制代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
0
不多说就是找有几个相邻的是不同的：
代码：
复制代码#include <iostream>
#include<stdio.h>
using namespace std;
int main()
{
int t,ans,i;
char c[51];
while(cin>>t)
{
cin>>c;
ans=0;
for(i=0;i<(t-1);i++)
{
if(c[i]!=c[i+1])
ans++;
}
cout<<(t-1-ans)<<endl;
}
return 0;
}
#include <iostream>
#include<stdio.h>
using namespace std;
int main()
{
int t,ans,i;
char c[51];
while(cin>>t)
{
cin>>c;
ans=0;
for(i=0;i<(t-1);i++)
{
if(c[i]!=c[i+1])
ans++;
}
cout<<(t-1-ans)<<endl;
}
return 0;
}