Question G: Word Analysis ← Questions for the second provincial competition of the 11th Blue Bridge Cup Competition

[Problem Description]
Xiao Lan is learning a magical language, the words in this language are all written in lowercase EnglishMade up of letters, some words are very long, far exceeding the length of normal English words.Xiaolan has been learning for a long time and can't remember some words. He plans to stop memorizing these words completely, but to distinguish words according to which letter in the word appears the most.
Now, please help Xiao Lan. After giving a word, help him find the letter that appears the most and the number of times that letter appears.

[Input Format]
The input line contains one word, and the word consists of lowercase English letters only.

[Output format]
The output consists of two lines, the first line contains an English letter, which indicates which letter appears the largest in the word, if there are multiple letters appearingThe number of times is equal, and the one with the smallest dictionary sequence is output.

[Algorithm Code One]

#include using namespace std;int num[27];int main() {string s;cin>>s;for(int i=0; i


[Algorithm code 2]

#include using namespace std;const int maxn=1005;int num[maxn];int main() {string s;cin>>s;for(int i=0; i


[References]
https://blog.csdn.net/qq_20144897/article/details/122956448