hdoj 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

red

pink

 

#include <iostream>
#include <bits/stdc++.h>   //º¼µç²»ÈÏͬ
using namespace std;
typedef struct node{
    struct node*next[26];
    int value;
    int num;
    }*trie,node;
    trie root;

    void init_trie(trie&p){
    p=(trie)malloc(sizeof(node));
    for(int i=0;i<26;i++)

        p->next[i]=0;
        p->value=p->num=0;
    }
    void insert(trie p,char s[])
    {
        int k=0;
        while (s[k]!='')
        {
            if(!p->next[s[k]-'a'])
            {
                trie q;
                init_trie(q);
                p->next[s[k]-'a']=q;
            }
            p=p->next[s[k]-'a'];
            p->num++;
            k++;
        }
        p->value=1;
    }
    int find (trie p,char s[]){
    int k=0;
    while(s[k]!=''&&p->next[s[k]-'a'])
    {

        p=p->next[s[k]-'a'];
        k++;
    }
    if(s[k]=='')
        return p->num;
    return 0;

    }

int main()
{  int n;
    while(scanf("%d",&n)!=EOF&&n)
    {  init_trie(root);
    char ch[1005][17];
    for(int i=0;i<n;i++)
    {
        cin>>ch[i];
        insert(root,ch[i]);
    }
    int max=0,tem,f;
    for(int i=0;i<n;i++)
    {
        tem=find(root,ch[i]);
        if(tem>max)
        {
            max=tem;
            f=i;
        }
    }
    cout<<ch[f]<<"
";

        }
        return 0;
}