mirror of
https://github.com/m1ngsama/code4sk.git
synced 2025-12-25 02:56:17 +00:00
46 lines
696 B
C++
46 lines
696 B
C++
/*
|
|
7-5 ???????????????
|
|
?? 10
|
|
?? ???
|
|
?? ????
|
|
??????,????????????,?????????????????3???1234?2345?3456,????????????3?4,????3??
|
|
|
|
????:
|
|
????1???????N(=1000),???????N?????????????,?????????
|
|
|
|
????:
|
|
???????“M: n1 n2 ...”??,??M?????,n1?n2?……????????????,???????????????????,???????????
|
|
|
|
????:
|
|
3
|
|
1234 2345 3456
|
|
????:
|
|
3: 3 4
|
|
*/
|
|
|
|
|
|
#include<stdio.h>
|
|
int main(){
|
|
int N,i;
|
|
scanf("%d",&N);
|
|
int a[N],b[10],c;
|
|
for(i=0;i<10;i++)
|
|
b[i]=0;
|
|
for(i=0;i<N;i++){
|
|
scanf("%d",&a[i]);
|
|
if(a[i]==0) b[0]++;
|
|
for(;a[i]!=0;a[i]/=10){
|
|
c=a[i]%10;
|
|
b[c]++;
|
|
}
|
|
}
|
|
int max=b[0];
|
|
for(i=1;i<10;i++){
|
|
if(max<b[i]) max=b[i];
|
|
}
|
|
printf("%d:",max);
|
|
for(i=0;i<10;i++){
|
|
if(max==b[i]) printf(" %d",i);
|
|
}
|
|
return 0;
|
|
}
|