#t272. 统计字符数
统计字符数
Character Counting
Problem Background
Special for beginners, ^_^
Problem Description
Given a string composed only of the characters a-z, count which character appears the most times.
Input Format
The input contains one line: a string of length at most .
Output Format
Output one line containing the most frequent character and its count, separated by a single space. If several characters have the same maximum count, output the one with the smallest ASCII code.
Sample Input
abbccc
Sample Output
c 3
Constraints
1s, 1024KiB for each test case.