HDU 1004暴力

Let the Balloon Rise

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

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

      题目的意思就是输出最多的颜色，看了看题目给出的数据范围也不大，才1000，1000*1000也才10^6<<10^8于是就用暴力法解的试试，以下是我的最初代码，用C++的string类型挺简单的

#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;

int main()
{
    int n;
    while(~scanf("%d",&n)&&n)
    {
        string arr[1005];
        int a[1005];
        for(int i=0; i<n; i++)
        {
            cin>>arr[i];
            a[i]=0;
        }
        for(int i=0; i<n; i++)
            for(int j=1; j<n; j++)
                if(arr[i]==arr[j]) a[i]++;
        int max=0,k=0;
        for(int i=0; i<n; i++)
        {
            if(max<a[i])
            {
                max=a[i];
                k=i;
            }
        }
        cout<<arr[k]<<endl;
    }
    return 0;
}

     一次AC，暴力法永远是最好的方法，前提是不超时。