HDU 1004 Let the Balloon Rise

Let the Balloon Rise

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

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

1
2
3
4
5
6
7
8
9
10
11
5
green
red
blue
red
red
3
pink
orange
pink
0

Sample Output

···
red
pink
···

Idea

给出各种颜色(字符串),求颜色相同最多的。
原题地址:http://acm.hdu.edu.cn/showproblem.php?pid=1004

Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
#include <stdio.h>
#include <string.h>
#define MAXN 1005

int main(void)
{
int n;
int i, j, max;
int a[MAXN];
char c[MAXN][16];
//freopen("input.txt", "r", stdin);
scanf("%d", &n);
while(n > 0)
{
memset(a, 0, sizeof(int) * MAXN);
for(i = 0; i < n; i++)
{
scanf("%s", c[i]);
++a[i];
for(j = 0; j < i; j++)
{
if(strcmp(c[i], c[j]) == 0)
{
++a[j]; break;
}
}
}
max = 0;
for(i = 0; i < n; i++)
{
if(a[max] < a[i]) max = i;
}
printf("%s\n", c[max]);
scanf("%d", &n);
}
return 0;
}
坚持原创技术分享,您的支持将鼓励我继续创作!