Educational Codeforces Round 26 A. Text Volume
来源:互联网 发布:周笔畅的淘宝店 编辑:程序博客网 时间:2024/06/05 06:02
题目网址: Educational Codeforces Round 26 A. Text Volume
题意分析:
- 给一个串, 输出串中单词所含的大写字母个数最多的数目
- 一次循环即可
代码:
#include <bits/stdc++.h>using namespace std;int main(int argc, char const *argv[]){ string word; int n; while (~scanf("%d", &n)) { getchar(); getline(cin, word); int len = (int)word.length(); int cnt = 0, MAX = 0; for (int i = 0; i < len; ++i) { while (i < len && word[i] == ' ') { ++i; } cnt = 0; while (i < len && word[i] != ' ') { if(word[i] >= 'A' && word[i] <= 'Z') ++cnt; ++i; } MAX = max(cnt, MAX); } printf("%d\n", MAX); } return 0;}
阅读全文
0 0
- Educational Codeforces Round 26;A. Text Volume
- Educational Codeforces Round 26 A. Text Volume
- Educational Codeforces Round 4 A. The Text Splitting
- Educational Codeforces Round 26 A—C
- codeforces 837A Text Volume
- codeforces 837A Text Volume
- Codeforces 837A Text Volume
- Educational Codeforces Round 5 A
- Educational Codeforces Round 20 A
- Educational Codeforces Round 21 A
- Educational Codeforces Round 23 A
- Educational Codeforces Round 26
- Educational Codeforces Round 26
- codeforces Educational Codeforces Round 21 A
- Educational Codeforces Round 26 A B C 三道水题
- Educational Codeforces Round 26总结
- Educational Codeforces Round 26 B
- Educational Codeforces Round 26 C
- 删除小写字母字符串中重复字符
- SourceTree本地分支误删解决办法
- 集成学习(Ensemble Learning)
- ODF光纤配线架
- Camera---获得摄像机的视口区域(转载大神雨松MOMO)
- Educational Codeforces Round 26 A. Text Volume
- Java上传Excel并解析
- 简单布隆过滤器实现、布隆过滤器扩展
- [转]深度学习如何入门?
- HDU 1892 See you~(二维树状数组 单点更新)
- window下eclipse ndk配置
- Kail Linux fluxion WiFi破解
- 百度传课-php2小时超音速入门
- 在大学老师布置的一些题目,欢迎各位大佬指正(6)