codeforces 266A Stones on the Table(模拟水题)

本文介绍了一道编程题,任务是计算在一行不同颜色的石头中,为了确保任意相邻的两颗石头颜色不同所需移除的最少石头数量。文中提供了一个示例代码,展示了如何通过遍历字符串并比较相邻字符来解决问题。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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

不多说就是找有几个相邻的是不同的:
代码:
#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;
}                                                                                                                                                                  


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值