得分(Sorce,ACM/ICPC Seoul 2005,Uva1585)
来源:互联网 发布:电脑屏幕录制软件 免费 编辑:程序博客网 时间:2024/06/06 20:59
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'
outputYour 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.
A:
#include<stdio.h>#include<string.h>#define MAX 85void sorce(char const *s);int main(void){char s[MAX];int n;scanf("%d",&n);for(int i=0;i<n;i++){scanf("%s",s);sorce(s);}return 0;}void sorce(char const *s){int len,count=0,sum=0;len=strlen(s);for(int i=0;i<len;i++){if(s[i]=='O'){count++;sum+=count;}if(s[i]=='X'){count=0;}}printf("%d\n",sum);}
其实这个题目是比较简单的那种,思路也比较好想.利用一个计数器count,遇到'O'就加1,遇到'X'就归0;
- 得分(Sorce,ACM/ICPC Seoul 2005,Uva1585)
- 得分 (Score, ACM/ICPC Seoul 2005, UVa1585)
- 得分(Score, ACM/ICPC Seoul 2005, UVa1585)
- 得分(Score,ACM/ICPC Seoul 2005,UVa1585)
- Score,ACM/ICPC Seoul 2005,UVa1585
- [Score, ACM/ICPC Seoul 2005, UVA1585]
- 得分(Score, ACM/ICPC Seoul 2005, UVa 1585)
- 习题3-1 得分(Score, ACM/ICPC Seoul 2005, UVa 1585)
- 生成元(Digit Generator,ACM/ICPC Seoul 2005, UVa1583)
- 生成元(Digit Generator, ACM/ICPC Seoul 2005, UVa1583)
- 生成元(Digit Generator, ACM/ICPC Seoul 2005, UVa1583)
- Score, ACM/ICPC Seoul 2005, UVa 1585
- Digit Generator, ACM/ICPC Seoul 2005, UVa1583
- [Digit Generator, ACM/ICPC Seoul 2005, UVA1583]
- 得分(Score,UVa1585)
- 最小生成元 (Digit Generator, ACM/ICPC Seoul 2005, UVa1583)
- 分子量(Molar Counting, ACM/ICPC Seoul 2007, UVa1586)
- 环状序列(Circular Sequence, ACM/ICPC Seoul 2004, UVa1584)
- poj1273 网络流 Edmonds_Karp
- JavaScript之apply,call以及bind方法
- Core Animation - 过渡动画 CATransition
- linux下调试PHP core文件
- 调用系统相机 bundle为null
- 得分(Sorce,ACM/ICPC Seoul 2005,Uva1585)
- Illegal mix of collations (utf8_general_ci,IMPLICIT) and (utf8_unicode_ci,IMPLIC
- CODEFORCES Rockethon 2015 B. Permutations
- 上传视频时自动完成截取缩略图(一)
- iOS-tableview上方出现一段空白的原因及解决办法
- sqlserver 时间格式函数
- 高性能tomcat
- 文件变化监视 java.nio.file.WatchService
- iOS 检测版本更新