Codeforces #494 A. Polycarp's Pockets

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相关推荐

codeforces 1003A. Polycarp's Pockets，C. Intense Heat（暴力）
A. Polycarp's Pockets 题目链接:codeforces 1003A 题意: 给n个数,要求相同的数不能放在一个口袋,问最少需要多少个口袋题解: 求出最多的相同数 ...
CodeForces - 1003A Polycarp's Pockets
题目链接: A. Polycarp's Pockets time limit per test 1 second memory limit per test 256 megabytes input s ...
codeforces 解题报告 1003A. Polycarp's Pockets 模拟
http://codeforces.com/problemset/problem/1003/A 解题思路: 1.每个包里只能有不同面额的硬币,问要多少个包才能装完这堆硬币 2.弄n个桶,桶内是相同硬币 ...
codeforces 1003a Polycarp's Pockets
http://www.elijahqi.win/archives/3910 求出现次数最多的数出现几次 #include<bits/stdc++.h> using namespace st ...
落谷CF1003A Polycarp's Pockets
题目描述 Polycarp has n n n coins, the value of the i i i -th coin is ai a_i ai . Polycarp wants to dis ...
Codeforces 864 B Polycarp and Letters 暴力
题目链接: http://codeforces.com/problemset/problem/864/B 题目描述: 看看连续子串都是小写字母的字母种类最多是多少解题思路: 暴力, 枚举起点和终点, ...
【 CodeForces - 864B】Polycarp and Letters（水题，字符串，有坑）
题干: Polycarp loves lowercase letters and dislikes uppercase ones. Once he got a string sconsisting o ...
Codeforces Round #494 (Div. 3)【未完结】
2022.3.4 题目地址:https://codeforces.com/contest/1003 目录 A. Polycarp's Pockets[模拟] B. Binary String Cons ...
Codeforces Round #494 (Div. 3)
get 高效位运算 * __builtin _ __builtin_ll(函数名后加ll表示longlong)* __builtin_ffs(unsigned int x) 返回x最后一个1是从右往左 ...

Codeforces #494 A. Polycarp's Pockets

Codeforces #494 A. Polycarp's Pockets相关推荐

最新文章

热门文章