#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
#define M 100
#define N 26
struct cryp{
int freq;
char let;
};
bool compare(cryp c1,cryp c2);
int main()
{
struct cryp count[M];
register long i,n,p;
char letter[10000],ch,c;
//freopen("in.txt","r",stdin);
for(i=0;i<M;i++)
count[i].freq=0,count[i].let=i+65;
scanf("%d%c",&n,&c);
while(n--)
{
gets(letter);
for(i=0;letter[i];i++)
{
ch=letter[i]&223;
p=(ch^64)-1;
count[p].freq++;
}
}
sort(count,count+N,compare);
for(i=0;count[i].freq;i++)
printf("%c %d\n",count[i].let,count[i].freq);
return 0;
}
bool compare(cryp c1,cryp c2)
{
if(c1.freq>c2.freq)
return true;
else if(!(c1.freq^c2.freq)&&c1.let<c2.let)
return true;
return false;
}
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.