【题解】UVA 1585

该博客详细解析了UVA 1585题目的要求和解题思路。给定一个由'O'(正确答案)和'X'(错误答案)组成的字符串,每个'O'的得分由其自身及其前连续'O'的数量决定,当遇到'X'时得分停止累积。博主提供了题意分析及AC代码,帮助理解并解决该问题。

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

目录

 

题目描述

题意分析

AC代码


题目描述

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.

 

Sample Input

5

OOXXOXXOOO

OOXXOOXXOO

OXOXOXOXOXOXOX

OOOOOOOOOO

OOOOXOOOOXOOOOX

 

Sample Output

10

9

7

55

30

题意分析

题意: 遇到 X 就停止连击,否则则加上连击分数(例如:连续的OO 则是 1 + 2)。问给你这个串的分数结果是多少。

AC代码

/**
* Copyright(c)
* All rights reserved.
* Author : Universal
* Description : sample
*/
#include <bits/stdc++.h>
#define MAXN 100005
#define INF 0x3f3f3f3f
#define PI acos(-1)
using namespace std;
typedef long long ll;

int main(){
    int t,sum,combe;
    string s;
    cin>>t;
    while(t--){
        cin>>s;
        sum = 0;combe =0;
        for(int i=0;i<s.size();i++){
            if(s[i] == 'O') {
                sum += (++combe);
            }
            else{
                combe = 0;
            }
        }
        cout<<sum<<endl;
    }
    return 0;
}

 

评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值