HDU 1004 Let the Balloon Rise

原题网址： http://acm.hdu.edu.cn/showproblem.php?pid=1004

                                              Let the Balloon Rise

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

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

5greenredblueredred3pinkorangepink0

 

Sample Output

redpink

水题一个  可能是杭电的数据太弱  结果我用最暴力的方法也只有15ms
这个题我的想法很简单就是  暴力！！ 具体代码如下 ：

#include <iostream>#include <cstdlib>#include <cstdio>using namespace std;int main() {    char num[1001][16];    int n;    while (cin >> n) {        if (n == 0) return 0;        int i;        int arr[1001] = {0};        for(i = 0; i < n; i++) {            cin >> num[i];        }        int j;        int max = 0;        for(j = 0; j < n; j++)         for(i = 0; i < n; i++) {            if(!strcmp(num[i],num[j]))            arr[j]++;        }        for(i = 0; i < n; i++) {            if(max < arr[i])            max = i;        }        cout << num[max] <<endl;    }}