- A. Polycarp's Pockets
- 废话不多说,直接上AC程序!
#include<bits/stdc++.h> using namespace std; int n,x; int t[101]; int main(){ scanf("%d",&n); for (int i=1;i<=n;i++){ scanf("%d",&x); t[x]++; } int maxx=0; for (int i=1;i<=100;i++) maxx=max(maxx,t[i]); printf("%d",maxx); return 0; }
Codeforces #494 A. Polycarp's Pockets
猜你喜欢
转载自blog.csdn.net/scy1106/article/details/80984520
今日推荐
周排行