| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 156938 | 赵奕杰 | 统计字符数量 | C++ | Wrong Answer | 1 MS | 272 KB | 637 | 2026-07-11 15:34:34 |
#include <iostream> #include <string> using namespace std; int main() { string str; cin >> str; int count[26] = {0}; for (char c : str) { if (c >= 'a' && c <= 'z') { count[c - 'a']++; } } // 找出最大出现次数 int maxCount = 0; for (int i = 0; i < 26; i++) { if (count[i] > maxCount) { maxCount = count[i]; } } for (int i = 0; i < 26; i++) { if (count[i] == maxCount) { cout << "'" << char('a' + i) << "' "; } } cout << maxCount ; return 0; }
------Input------
svwdidkifwmtojpntabjgfvxudyivijuwuhanzccuaiestteksyyzdfbnnoniketllnjniqvxkkcqxtjkatxormrbpejqhadzffoyznyaqdesdosjvumdgfuezbjhpvsaqqzkycalzwwetglxtzyuskpjerwjrfvdoybvnhnwzmhsdifzeqmphilyshsqamfiykvbnvjxssomxizjvjqwymwzhmqeoymnihkqwulwfqtdptkyajtznxyvgsurhuuhuauimjixcrtargswyraxumocnnrlhuewsgnavkfihzhvfmaqnhjocldrqoknjlblzwriiuafowfvcwextycmdrxoqvebfjwvozijqwrdinrgzeqdrsoxaprgqjtbdwsufxawlhecgrgasnkxpfqzbmappzjrqxpbkvnbverqqabpjlnrrxbwematjcflxzlctdhqshgzqzrfxphpsucamdsekrwdimzwvpwwzdvzsipykhecunt
------Answer-----
w 50
------Your output-----
'w' 50