| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 156937 | 赵奕杰 | 统计字符数量 | C++ | Wrong Answer | 0 MS | 264 KB | 741 | 2026-07-11 15:33:34 |
#include <iostream> #include <cstring> using namespace std; int main() { char str[1001]; // 1000个字符 + 1个结束符 // 读取一行字符串 cin.getline(str, 1001); int count[26] = {0}; // 统计每个字母出现的次数 for (int i = 0; i < strlen(str); i++) { if (str[i] >= 'a' && str[i] <= 'z') { count[str[i] - 'a']++; } } // 找出出现次数最多的字母 int maxCount = 0; char maxChar = 'a'; for (int i = 0; i < 26; i++) { if (count[i] > maxCount) { maxCount = count[i]; maxChar = 'a' + i; } } cout << maxChar << endl; return 0; }
------Input------
svwdidkifwmtojpntabjgfvxudyivijuwuhanzccuaiestteksyyzdfbnnoniketllnjniqvxkkcqxtjkatxormrbpejqhadzffoyznyaqdesdosjvumdgfuezbjhpvsaqqzkycalzwwetglxtzyuskpjerwjrfvdoybvnhnwzmhsdifzeqmphilyshsqamfiykvbnvjxssomxizjvjqwymwzhmqeoymnihkqwulwfqtdptkyajtznxyvgsurhuuhuauimjixcrtargswyraxumocnnrlhuewsgnavkfihzhvfmaqnhjocldrqoknjlblzwriiuafowfvcwextycmdrxoqvebfjwvozijqwrdinrgzeqdrsoxaprgqjtbdwsufxawlhecgrgasnkxpfqzbmappzjrqxpbkvnbverqqabpjlnrrxbwematjcflxzlctdhqshgzqzrfxphpsucamdsekrwdimzwvpwwzdvzsipykhecunt
------Answer-----
w 50
------Your output-----
w