湖北民族学院oj 1888 之 Happiness

888: Happiness

Time Limit: 1 Sec     Memory Limit: 1280 MB
Total Submissions: 13     Accepted: 11
[ Submit]   [ Statistic]   [ Go Back]

题目描述

       Chicken brother is very happy today, because he attained N pieces of biscuits whose tastes are A or B. These biscuits are put into a box. Now, he can only take out one piece of biscuit from the box one time. As we all know, chicken brother is a creative man. He wants to put an A biscuit and a B biscuit together and eat them. If he take out an A biscuit from the box and then he take out a B biscuit continuously, he can put them together and eat happily. Chicken brother’s happiness will plus one when he eat A and B biscuit together one time.

      Now, you are given the arrangement of the biscuits in the box(from top to bottom) ,please output the happiness of Chicken Brother when he take out all biscuit from the box. 

输入描述

       The first line is an integer indicates the number of test cases.

       In each case, there is one line includes a string consists of characters ‘A’ and ‘B’.

       The length of string is not more than 1000000. 

输出描述

     For each test case:

    The first line output “Case #k:", k indicates the case number.    

    The second line output the answer. 

输入样例

1
ABABBBA

输出样例

Case #1:
2

AC代码如下：
#include <iostream>
#include <cstring>
using namespace std;
const int maxn=1000000+10;

char a[maxn];

int main()
{
    int n;
    cin>>n;
    for(int j=0;j<n;j++)
    {
        cin>>a;
        int count=0;
        int len=(int)strlen(a);
        for(int i=0;i<len;i++)
        {
            if(i+1<len && a[i]=='A' && a[i+1]=='B')
                count++;
        }
        cout<<"Case #"<<j+1<<":"<<endl;
        cout<<count<<endl;
    }
    return 0;
}