#include<iostream>
#include<algorithm>
using namespace std;
struct freq
{
char ch;
int f;
};
bool compare(freq,freq);
int main()
{
char sent[210];
int t,i,k;
struct freq F[200];
//freopen("in.txt","r",stdin);
scanf("%d\n",&t);
while(t--)
{
gets(sent);
for(i=96;i<130;i++)
F[i].ch=i,F[i].f=0;
for(i=0;sent[i];i++)
F[sent[i]|32].f++;
sort(F+97,F+127,compare);
k=F[97].f,i=97;
while(F[i].f==k)
printf("%c",F[i++].ch);
printf("\n");
}
return 0;
}
bool compare(freq f1,freq f2)
{
if(f1.f<f2.f)
return false;
else if(f1.f==f2.f&&f1.ch>f2.ch)
return false;
return true;
}
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.