让气球飞一会儿（hdu1004）

最新推荐文章于 2021-10-27 14:46:59 发布

klfc183

最新推荐文章于 2021-10-27 14:46:59 发布

阅读量928

点赞数

文章标签：杭电 acm color 1004 Let the Balloon Rise

本文链接：https://blog.csdn.net/klfc183/article/details/38372817

版权

杭电1004

题目：

Let the Balloon Rise

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 73568 Accepted Submission(s): 27482

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.

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.

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

      
      
       
       5
green
red
blue
red
red
3
pink
orange
pink
0

Sample Output

Author

WU, Jiazhi

Source

ZJCPC2004

Recommend

JGShining

Statistic | Submit | Discuss | Note

Home |Top

Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2014 HDU ACM Team. All Rights Reserved.
Designer & Developer:Wang Rongtao LinLe GaoJie GanLu
Total 0.000744(s) query 1, Server time : 2014-08-04 17:36:18, Gzip enabled

中文大意：

让气球上升

比赛时间............................................................(描述略)！

输入：先输入N，表示N组颜色，接下来有N组数据，（最多有1000组颜色，每个小于15字符）

输出：输出出现次数最多的一项（占一行）

解题思路：

输入：用二维数组存储；

计算：用每一个与后面的比较，找出出现次数最多的一项

输出：将对应颜色输出

关键点：

数据的存储，以及颜色的记录；

再者就是使程序更快运行，可用一个数组对前面已经出现过且已经参与比较的颜色进行标记，当轮到她与后面的比较的时候，就可以跳过，（因为它与后面相同颜色的个数一定小于前面已经出现过的那个，所以无需比较）

本题还有就是，当所有的颜色都能不一样的时候，输出第一个！

具体代码实现如下：

//xiao ceshi
# include<stdio.h>
# include<string.h>
#define M 2000
char a[M+10][20];
char k[M+10];

int main(){
int n;
int i,j;
int max,s,t;
while(scanf("%d",&n)&&n){
  getchar();
  max=1;
  t=0;
  memset(k,0,sizeof(k));
  for(i=0;i<n;i++){
   gets(a[i]);
  }
  for(i=0;i<n-1;i++){
   if(k[i])
   continue;
   s=1;
   for(j=i+1;j<n;j++){
    if(!strcmp(a[i],a[j])){
     k[j]=1;
     s++;
    }
   }
   if(s>max){
    max=s;     //记录数量
    t=i;     //记录下标
   }
  }
  puts(a[t]);
}
return 0;
}