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.
A test case with N = 0 terminates the input and this test case is not to be processed.
5 green red blue red red 3 pink orange pink 0
题意:
求出现次数最多的气球颜色
代码一:
#include<stdio.h>
#include<string.h>
using namespace std;
struct node{
int num;
char s[20];
}a[1005];
int n;
int main(){
while(scanf("%d",&n)!=EOF){
if(n==0) break;
memset(a,0,sizeof(a));
scanf("%s",&a[0].s);
a[0].num++;
int k=1;
for(int i=1;i<n;i++){
char ch[20];
scanf("%s",ch);
int j;
for(j=0;j<k;j++){
if(!strcmp(a[j].s,ch)){
a[j].num++;
break;
}
}
if(j==k){
strcpy(a[k].s,ch);
a[k].num=1;
k++;
}
}
int best=0;
for(int i=0;i<k;i++){
if(a[i].num>a[best].num){
best=i;
}
}
printf("%s\n",a[best].s);
}
return 0;
}
代码二:
#include<stdio.h>
#include<iostream>
#include<string>
#include<iterator>
#include<map>
using namespace std;
int main(){
int n;
while(scanf("%d",&n)!=EOF){
if(n==0) break;
map<string,int>mp;
string str;
for(int i=0;i<n;i++){
cin>>str;
mp[str]++;
}
int num=0;
for(map<string,int>::iterator iter=mp.begin();iter!=mp.end();iter++){
if(iter->second>num){
num=iter->second;
str=iter->first;
}
}
cout<<str<<endl;
}
return 0;
}