ACM_HDU 1004 Let the Balloon Rise(还是水题做着开心)

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



水题嘿,可以用strcmp,刚学c++,用map实现一发。
#include     
#include   
#include   
using namespace std;  
int main()  
{  
    int n;  
    string color,s;  
    mapBalloon;  
    while(scanf("%d",&n)&&(n!=0))  
    {  
        Balloon.clear();  //reset
        for(int i=0;i>color;  
            Balloon[color]++;  
        }  
        int max=-1;  //reset
        map::iterator p;  
        for(p=Balloon.begin();p!=Balloon.end();p++)  
        {  
            if((*p).second>max)  
            {  
                max=(*p).second;  
                s=(*p).first;  
            }  
        }  
        cout<









 
   
red pink

你可能感兴趣的:(HDU,ACM)