HDOJ1104Let the Balloon Rise

最新推荐文章于 2020-03-21 13:52:36 发布

sthahahaa

最新推荐文章于 2020-03-21 13:52:36 发布

阅读量545

点赞数

分类专栏： HDOJ基础题文章标签： HDOJ1004

本文链接：https://blog.csdn.net/bw761813/article/details/18181063

版权

HDOJ基础题专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Let the Balloon Rise

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

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

  
  
   
   red
pink

Author

WU, Jiazhi

Source

ZJCPC2004

Recommend

JGShining | We have carefully selected several similar problems for you: 1001 1008 1005 1003 1009

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
typedef struct color{
    char s[20];
}color;
color t[1005];
int cmp ( const void *a , const void *b ){ 
    return strcmp( (*(color *)a).s , (*(color *)b).s ); 
} 
int main(void){
    int n;
    while(scanf("%d", &n), n){
        int i = 0;
        int j;
        int max = 1;
        int sum = 1;
		int seq = 0;
        for( ; i < n; i++) scanf("%s", t[i].s);
        qsort( t, n, sizeof(t[0]), cmp);
        for( j = 1; j < n; j++){
            if(!strcmp(t[j].s, t[j-1].s)) sum++;
            else sum = 1;
            if(sum > max){
                max = sum;
                seq = j;
            }
        }
        puts(t[seq].s);
    }
    return 0;
}