HDUOJ 1004 Let the Balloon Rise(map容器)
来源:互联网 发布:淘宝店铺怎么设置淘客 编辑:程序博客网 时间:2024/05/21 18:50
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 125040 Accepted Submission(s): 49360
Problem Description
Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest is over, they will count the balloons of each color and find the result.
This year, they decide to leave this lovely job to you.
This year, they decide to leave this lovely job to you.
Input
Input contains multiple test cases. Each test case starts with a number N (0 < N <= 1000) -- the total number of balloons distributed. The next N lines contain one color each. The color of a balloon is a string of up to 15 lower-case letters.
A test case with N = 0 terminates the input and this test case is not to be processed.
A test case with N = 0 terminates the input and this test case is not to be processed.
Output
For each case, print the color of balloon for the most popular problem on a single line. It is guaranteed that there is a unique solution for each test case.
Sample Input
5greenredblueredred3pinkorangepink0
Sample Output
redpink
#include<bits/stdc++.h>using namespace std;int main(){string a,maxcolor;int n,max;map<string, int> mymap;while(~scanf("%d",&n)&&n!=0){mymap.clear();//删除所有元素 while(n--){cin>>a;mymap[a]++;}map<string, int>::iterator it;max=0;for(it=mymap.begin(); it!=mymap.end();it++){if(it->second>max){max=it->second;//second 是int类型的 值 maxcolor=it->first;//first是map中的第一个string类型的元素 键 }}cout<<maxcolor<<endl;}return 0;}
#include <stdio.h>#include <string.h>int main(){ int n,i,j,num[1000]; int max=0,t=0; char color[1000][16]; while(scanf("%d",&n)!=EOF) { if(n) { num[0]=0; scanf("%s",color[0]); for(i=1;i<n;i++) { num[i]=0; scanf("%s",color[i]); for(j=0;j<i-1;j++) if(strcmp(color[i],color[j])==0) num[i]+=1; } max=0; t=0; for(i=1;i<n;i++) if(max<num[i]) { max=num[i]; t=i; } printf("%s\n",color[t]); } }}
阅读全文
0 0
- HDUOJ 1004 Let the Balloon Rise(map容器)
- HDUoj- 1004 -Let the Balloon Rise ( map
- HDUOJ Let the Balloon Rise 1004
- HDUOJ 1004 - Let the Balloon Rise
- [HDUOJ] 1004 Let the Balloon Rise
- HDUOJ Let the Balloon Rise
- Let the Balloon Rise(Map容器)
- map容器的应用:hdu 1004 Let the Balloon Rise
- HDOJ 1004 Let the Balloon Rise (map)
- HDU 1004 Let the Balloon Rise【Map】
- hdu 1004 Let the Balloon Rise map
- HDU 1004 Let the Balloon Rise(map)
- hdoj 1004 Let the Balloon Rise (map)
- HDU 1004 Let the Balloon Rise map
- Let the Balloon Rise (map)
- 2104:Let the Balloon Rise——map容器
- ZOJ 2104/HDU 1004 Let the Balloon Rise(map容器)
- 1004 Let the Balloon Rise
- thinkphp的几种跳转方法
- 【跟着stackoverflow学Pandas】add one row in a pandas.DataFrame -DataFrame添加行
- Pytorch简介
- Codeforces
- 2017.8.5
- HDUOJ 1004 Let the Balloon Rise(map容器)
- 【hautoj 1283】: YK的书架 【打表找规律】
- JavaWeb项目:整合(Lucene+Redis+SSM)实现搜索功能
- Android生成带图片的二维码
- 待起飞的の集训8.5
- eclipse中maven因没有web.xml报错
- [bzoj4597/Shoi2016]随机序列
- POJ 1436 Horizontally Visible Segments(线段树区间更新)
- 《leetCode》:palindrome Number