UVa1585 Score

最新推荐文章于 2025-11-29 12:41:34 发布

原创最新推荐文章于 2025-11-29 12:41:34 发布 · 610 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #算法 #uva #xcode

ACM算法竞赛专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一个简单的算法，用于计算一种特殊格式的客观测试答案的得分。这种格式的测试由'O'和'X'组成，'O'代表正确答案，'X'代表错误答案。文章中的算法通过计算连续正确的答案数量来确定每个问题的分数。

原题：

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 <cstring>
#define maxn 80
char input[maxn];
int main() {
    using namespace std;
    int T, score, count;
    if (scanf("%d",&T)==1) {
        //cin.get();
        while (T--) {
            scanf("%s",input);
            score= 0;
            count= 0;
            for (int i= 0; input[i]!='\0'; i++) {
                if(input[i]=='O') count++;
                else count= 0;
                score+= count;
            }
            printf("%d\n",score);
        }
    }
    
    return 0;
}