zoukankan      html  css  js  c++  java
  • uvaoj1585Score(暴力)

    1585 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.
    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表示0,连续的O排第几就表示几,计算一个字符串的总和。比如第一个样例,1+1+0+0+1+0+0+1+2+3=10

    注意:不要写多组输入,会T  ┭┮﹏┭┮

     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 char s[10000];
     4 int main() {
     5     int t;
     6     scanf("%d",&t);
     7     while(t--) {
     8         memset(s,'',sizeof(s));
     9         scanf("%s",s);
    10 
    11         long long ans=0,temp=0;
    12         for(int i=0; i<strlen(s); i++) {
    13             if(s[i]=='O')temp+=1;
    14             if(s[i]=='X')temp=0;
    15             ans+=temp;
    16         }
    17         printf("%lld
    ",ans);
    18     }
    19 
    20     return 0;
    21 }
  • 相关阅读:
    hdu 4144 状态压缩dp
    hdu 4118 树形dp
    hdu 4115 2-SAT判定
    hdu 4085 斯坦纳树
    hdu 3311 斯坦纳树
    hdu 4081 最小生成树+树形dp
    hdu 4424 并查集
    洛谷P2661信息传递
    洛谷P2746校园网
    树状数组模板
  • 原文地址:https://www.cnblogs.com/fqfzs/p/9861023.html
Copyright © 2011-2022 走看看