#include<stdio.h>
int main()
{
int n,i,m,j,temp,count = 0,a[10000],b[10000],max = 0,k;
scanf("%d",&n);
for(i = 0;i<=n-1;i++)
{
scanf("%d",&m);
while(m!=0)
{
j = m%10;
a[j]++;
m = m/10;
}
}
max = a[0];
for(i = 0;i<=9;i++)
{
if(max<a[i])
{
max = a[i];
}
}
j = 0;
for(i = 0;i<=9;i++)
{
if(max==a[i])
b[j++] = i;
count++;
}
for(j =0;j<count;j++)
{
for(k = 0;k<count-1-j;k++)
{
if(b[k]>b[k+1])
{
temp = b[k];
b[k] = b[k+1];
b[k+1] = temp;
}
}
}
printf("%d",b[count-1]);
return 0;
}
6-B排序
最新推荐文章于 2024-10-02 23:41:45 发布