codeforces 1003a Polycarp's Pockets

​​http://www.elijahqi.win/archives/3910​​​
求出现次数最多的数出现几次

#include<bits/stdc++.h>
using namespace std;
inline char gc(){
    static char now[1<<16],*S,*T;
    if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(!isdigit(ch)) {if (ch=='-') f=-1;ch=gc();}
    while(isdigit(ch)) {x=x*10+ch-'0',ch=gc();}
    return x*f;
}
const int N=110;
int cnt[N],n,a[N];
int main(){
//  freopen("a.in","r",stdin);
    n=read();int ans=0;
    for (int i=1;i<=n;++i) ++cnt[read()];
    for (int i=1;i<=100;++i) ans=max(ans,cnt[i]);
    printf("%d\n",ans);
    return 0;
}