zoukankan      html  css  js  c++  java
  • 【 OJ 】Score

    Score

      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.

    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 fi rst 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'.

    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.

    样例输入

    5
    OOXXOXXOOO
    OOXXOOXXOO
    OXOXOXOXOXOXOX
    OOOOOOOOOO
    OOOOXOOOOXOOOOX

    样例输出

    10
    9
    7
    55
    30

    源码

     1 #include <stdio.h>
     2 int main(){
     3     int n;
     4     int i = 0;
     5     int j = 0;
     6     int score;
     7     int sum = 0;
     8     char str[80];
     9     scanf("%d",&n);
    10     while(i<n){
    11         j = 0;
    12         sum = 0;
    13         score = 0;
    14         scanf("%s",str);
    15         while(str[j] != ''){
    16             if(str[j] == 'X')
    17                 score = 0;
    18             else
    19                 score++;
    20             sum += score;
    21             j++;
    22         }
    23         if(i==n-1)
    24             printf("%d",sum);
    25         else
    26             printf("%d
    ",sum);
    27         i++;
    28     }
    29     return 0;
    30 }
    道阻且长,行则将至。
  • 相关阅读:
    PV、UV、GMV
    保存Hive查询结果的方法 insert overwrite 用法
    Hive substr 函数截取字符串
    HIVE中join、semi join、outer join
    Hive 差集运算
    gitlab和github区别
    前端工程化 ESlint 配置
    ES6 WeakMap Map 区别
    js 创建数组方法以及区别
    eslint for...in 报错处理
  • 原文地址:https://www.cnblogs.com/forfriendforfun/p/8030114.html
Copyright © 2011-2022 走看看