uva 1585 - Score
2014-09-06 23:07
295 查看
#include<stdio.h> #include<string.h> char s[100]; int main() { int n; scanf("%d",& n); while (n--) { int m = 0, t = 0, i = 0; scanf("%s", s); for(int i=0;i<strlen(s);i++) { if (s[i] == 'X') m = 0; else { m++; t += m; } } printf("%d\n", t); } return 0; }
相关文章推荐
- 《算法竞赛入门经典2ndEdition 》习题3-1 得分(Score, Uva1585)
- Score UVA - 1585
- 【UVa】[1585]Score
- UVa 1585:Score
- UVa 1585 - Score
- 【习题3-1】 UVA - 1585 Score
- Score UVA - 1585
- UVA 1585 - Score
- [Score, ACM/ICPC Seoul 2005, UVA1585]
- Score(模拟)uva1585
- UVa 1585 - Score
- uva_1585_Score
- UVa1585 Score
- 算法竞赛入门经典(第2版)习题3-1 得分 Score UVa1585
- UVA-1585 Score
- UVa 1585 - Score
- 习题3-1 得分(Score, ACM/ICPC Seoul 2005, UVa 1585)
- Problem 007——UVa 1585 - Score
- UVA 1585 Score(模拟)
- UVa1585 Score