zoukankan      html  css  js  c++  java
  • Uva

    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 Tis 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
    AC代码:

    #include <stdio.h>
    #include <string.h>
    #define MAXN 85
    
    int main()
    {
    	int T;
    	char s[MAXN];
    	scanf("%d", &T);
    	while (T--) {
    		scanf("%s", s);
    		int n = strlen(s);
    		// p=0表示上个字符是x
    		int score = 0, p = 0, q = 1;
    		for (int i = 0; i < n; i++) {
    			// 不是很明确字母o是大写还是小写,两种情况都考虑
    			if (s[i] == 'o' || s[i] == 'O') {
    				if (p == 0) {
    					score += q++;
    					p = 1;
    				}
    				else {
    					score += q++;
    				}
    			}
    			else {
    				p = 0;
    				q = 1;
    			}
    		}
    		printf("%d
    ", score);
    	}
    
    	return 0;
    }



  • 相关阅读:
    希尔排序例子
    C
    重构最大堆的例子
    基于堆的优先队列和用优先队列排序的例子
    堆排序例子
    分治法示例
    三路划分的快速排序算法
    二叉搜索例子
    标准快速排序
    【转载】JAVA5新特性
  • 原文地址:https://www.cnblogs.com/zhangyaoqi/p/4591628.html
Copyright © 2011-2022 走看看