[C++]3-1 得分(Score ACM-ICPC Seoul 2005,UVa1585)

本文解析了一道ACM-ICPC竞赛中的计分程序题,题目要求根据由O和X组成的字符串计算总分,其中O代表正确答案,X代表错误答案。每个正确答案的分数等于其连续出现的次数。文章提供了完整的C++代码实现,并解释了如何通过遍历字符串并跟踪连续正确的答案来计算最终得分。

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

Question

习题3-1 得分(Score ACM-ICPC Seoul 2005,UVa1585)

题目:给出一个由O和X组成的串(长度为1~80),统计得分。
每个O的分数为目前连续出现的O的个数,X的得分为0。
例如:OOXXOXXOOO的得分为1+2+0+0+1+0+0+1+2+3。

 

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 ofOOXXOXXOOO” 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
10
9
7
55
30

Think

  简单题。略。

Code

/*
    习题3-1 得分(Score ACM-ICPC Seoul 2005,UVa1585)

    题目:给出一个由O和X组成的串(长度为1~80),统计得分。
        每个O的分数为目前连续出现的O的个数,X的得分为0。
        例如:OOXXOXXOOO的得分为1+2+0+0+1+0+0+1+2+3。
*/
#include<iostream>
#include<string.h>
using namespace std;

const int maxn = 85;
char str[maxn];

int main(){
    int n,sum;
    int prev;//记录前面累加的和
    scanf("%d", &n);
    while(n--){
        scanf("%s", &str);
        sum = prev = 0;//默认累计为0
        for(int i=0,len = strlen(str);i<len;i++){
            if(str[i] == 'O'){
                prev++;
                sum += prev;
            } else {
                prev = 0;
            }
        }
        printf("%d\n", sum);
    }
    return 0;
}

  

转载于:https://www.cnblogs.com/johnnyzen/p/9097430.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值