得分(Sorce,ACM/ICPC Seoul 2005,Uva1585)
2015-02-09 17:20
381 查看
Q:
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.
The following shows sample input and output for five test cases.
A:
其实这个题目是比较简单的那种,思路也比较好想.利用一个计数器count,遇到'O'就加1,遇到'X'就归0;
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 ofT 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.
#include<stdio.h> #include<string.h> #define MAX 85 void 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;
相关文章推荐
- 得分(Score,ACM/ICPC Seoul 2005,UVa1585)
- 得分(Score, ACM/ICPC Seoul 2005, UVa1585)
- 习题3-1 得分(Score, ACM/ICPC Seoul 2005, UVa 1585)
- 得分 (Score, ACM/ICPC Seoul 2005, UVa1585)
- 得分(Score,ACM/ICPC Seoul 2005,UVa 1585)
- 算法竞赛入门经典 习题3-1 得分(Score, ACM/ICPC Seoul 2005, UVa1585)
- 得分(Score,ACM/ICPC Seoul 2005,UVa1585)
- UVa 1585 - Score - ACM/ICPC Seoul 2005 解题报告 - C语言
- [Score, ACM/ICPC Seoul 2005, UVA1585]
- Score,ACM/ICPC Seoul 2005,UVa1585
- Score, ACM/ICPC Seoul 2005, UVa 1585
- 生成元(Digit Generator, ACM/ICPC Seoul 2005, UVa1583)
- 例题3-5 生成元(Digit Generator, ACM/ICPCSeoul 2005, UVa1583)
- 算法竞赛 例3-5生成元(Digit Generator,ACM/ICPC Seoul 2005,UVa1583)
- [Digit Generator, ACM/ICPC Seoul 2005, UVA1583]
- 生成元(Digit Generator, ACM/ICPC Seoul 2005, UVa1583)
- 【紫书】例题3-5 生成元(Digit Generator, ACM/ICPC Seoul 2005, UVa1583)
- 最小生成元 (Digit Generator, ACM/ICPC Seoul 2005, UVa1583)
- 生成元(Digit Generator ,ACM/ICPC Seoul 2005 ,UVa 1583)
- Digit Generator, ACM/ICPC Seoul 2005, UVa1583