[UVa 1585]:得分

最新推荐文章于 2021-02-08 09:05:44 发布

原创最新推荐文章于 2021-02-08 09:05:44 发布 · 460 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#计数器变为0

剑指ACM 专栏收录该内容

15 篇文章

订阅专栏

本文介绍了一道典型的计分程序题的实现方案。输入由多个测试案例组成，每个案例是一串由`O`和`X`字符组成的字符串，任务是计算每个案例中连续`O`的数量并累加得分。通过C语言实现，使用计数器跟踪连续`O`的出现次数，遇到`X`则将计数器重置为0。

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

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

#include<stdio.h>
#include<string.h>
#define N 85

int main()
{
    int num;
    char str[N];
    scanf("%d", &num);
    while(num--){
        scanf("%s", str);
        int len = strlen(str);
        int i = 0, time = 0, sum =0;
        for(; i<len; i++){
            if(str[i] == 'O'){
                time++;
                sum += time;
            } else {
                time = 0; // 碰到X检测O的计数器变为0
            }
        }
        printf("%d\n", sum);
    }
    return 0;
}

这里写图片描述