每日算法2 —— UVa1585得分Score,ACM/ICPC Seoul 2005

天使Di María

于 2023-01-15 00:04:50 发布

阅读量133

点赞数 1

分类专栏：算法文章标签：算法

本文链接：https://blog.csdn.net/m0_51339444/article/details/128690888

版权

算法专栏收录该内容

94 篇文章 14 订阅 ¥29.90 ¥99.00

订阅专栏

超级会员免费看

这是一个关于计算由'O'和'X'组成的字符串中，根据连续'O'的数量计算得分的问题。输入包含T个测试用例，每个用例是一串'O'和'X'，输出是对应的得分。示例输入和输出给出了问题的清晰解释。

摘要由CSDN通过智能技术生成

一、Question

1. 题目描述

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.
此题要求我们：给出一个由O和X组成的串（长度为1~80），统计得分。每个O的得分为目前连续出现的O的个数，X的得分为0。例如：OOXXOXXOOO的得分为1+2+0+0