coderforce 554B Ohana Cleans Up
来源:互联网 发布:阿里云免费套餐 编辑:程序博客网 时间:2024/06/11 02:04
题意:求最多有多少行相同
#include<stdio.h>#include<string.h>#include<string>#include<iostream>#include<map>#include<algorithm>using namespace std;map<string,int>q;int main(){ int n; while(scanf("%d",&n)!=EOF) { q.clear(); string s; int Max=0; for(int i=0;i<n;i++) { cin>>s; q[s]++; Max=max(Max,q[s]); } cout<<Max<<endl; }}
0 0
- coderforce 554B Ohana Cleans Up
- B. Ohana Cleans Up
- codeforces 554B B. Ohana Cleans Up
- Codeforces 554B Ohana Cleans Up
- CF 554B Ohana Cleans Up
- codeforces 554B Ohana Cleans Up
- CodeForces-554B Ohana Cleans Up
- CF 554B Ohana Cleans Up
- Codeforces 554B Ohana Cleans Up 【水题】
- CodeForces 554B. Ohana Cleans Up【思维】
- 【codeforces 554B Ohana Cleans Up】
- CodeForces 554B Ohana Cleans Up
- CodeForces 554B Ohana Cleans Up
- CodeForces 554B Ohana Cleans Up
- 【59.49%】【codeforces 554B】Ohana Cleans Up
- Ohana Cleans Up cf-554B【思维】
- Codeforces 554B Ohana Cleans Up 扫房间
- CodeForces - 554B Ohana Cleans Up (模拟)水
- 【hibernate集锦】---悲观锁和乐观锁
- 手指触摸旋转游戏物体和放大物体的代码实现
- Trips and Users --Hard
- 二叉树中度为0的结点数与度为2的结点数关系论证
- Xcode 7.1项目中Objective-C和swift混合编程(一)
- coderforce 554B Ohana Cleans Up
- 重建二叉树(已知两序求另一序)
- LVM逻辑卷扩容
- linux压缩和解压
- 【PAT】1087. All Roads Lead to Rome (30)
- OC第五天:字典、集、数组排序
- 某大学医疗系统更改版
- Ulua学习笔记
- 单例