-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathuva10008.cpp
47 lines (47 loc) · 889 Bytes
/
uva10008.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
using namespace std;
int main(){
string test,big="ABCDEFGHIJKLMNOPQRSTUVWXYZ",small="abcdefghijklmnopqrstuvwxyz";
int num[26]={0};
stringstream ss;
int Case=0,max=0;
getline(cin,test);
ss<<test;
ss>>Case;
while(Case--){
string s;
getline(cin,s);
for(int i=0;i<s.length();i++){
if(s[i]>64&&s[i]<91){
for(int j=0;j<big.length();j++){
if(s[i]==big[j]){
num[j]+=1;
break;
}
}
}else if(s[i]>96&&s[i]<123){
for(int j=0;j<small.length();j++){
if(s[i]==small[j]){
num[j]+=1;
break;
}
}
}
}
}
for(int i=0;i<26;i++){
if(num[i]!=0&&max<num[i]){
max=num[i];
}
}
for(int i=max;i>0;i--){
for(int j=0;j<26;j++){
if(num[j]==i){
cout<<big[j]<<" "<<num[j]<<endl;
}
}
}
}