[sicily]1324. Score

最新推荐文章于 2015-12-30 23:08:11 发布

大笨猪耶

最新推荐文章于 2015-12-30 23:08:11 发布

阅读量298

点赞数

分类专栏：数据结构与算法分析文章标签： sicily

本文链接：https://blog.csdn.net/luohuang0423/article/details/49365929

版权

数据结构与算法分析专栏收录该内容

58 篇文章 0 订阅

订阅专栏

1324. Score

Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

Description

There is an objective test result such as ``OOXXOXXOOO". An `O' means a correct answer of a problem and an `X' means a wrong answer. The score of each problem of this test is calculated by itself and its just previous consecutive `O's only when the answer is correct. For example, the score of the 10th problem is 3 that is obtained by itself and its two previous consecutive `O's.

Therefore, the score of ``OOXXOXXOOO" is 10 which is calculated by ``1+2+0+0+1+0+0+1+2+3".

You are to write a program calculating the scores of test results.

Input

Your program is to read from standard input. The input consists of T test cases. The number of test cases T is given in the first line of the input. Each test case starts with a line containing a string composed by `O' and `X' and the length of the string is more than 0 and less than 80. There is no spaces between `O' and `X'.

Output

Your program is to write to standard output. Print exactly one line for each test case. The line is to contain the score of the test case.

The following shows sample input and output for five test cases.

Sample Input

5 
OOXXOXXOOO 
OOXXOOXXOO 
OXOXOXOXOXOXOX 
OOOOOOOOOO 
OOOOXOOOOXOOOOX

Sample Output

简单计数题，利用一个计数变量扫描一遍即可。代码如下：

#include <iostream>
#include <string>
using namespace std;

int main()
{
    int n;
    cin>>n;
    while(n--)
    {
        int count=0,sum=0;
        string s;
        cin>>s;
        for(int i=0; i<s.size(); i++)
        {
            if(s[i]=='X')
                count = 0;
            else
                count++;
            sum += count;           
        }
        cout<<sum<<endl;
    }
    //system("pause");
    return 0;   
}