HDU 1004 字符串处理 大水题啊

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
  
  

 

我拿来练习下hash。。。

just for exercise;

/*
 * @author ipqhjjybj
 * @date  20130703
 *
 */

#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>

#include <iostream>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <utility>

#include <cstring>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <string>
using namespace std;

#define inf 0x3f3f3f3f
#define MAXN 2020
#define MOD 2020
#define clr(x,k) memset((x),(k),sizeof(x))
#define clrn(x,k) memset((x),(k),(n+1)*sizeof(int))
#define cpy(x,k) memcpy((x),(k),sizeof(x))
#define Base 10000

typedef vector<int> vi;
typedef stack<int> si;
typedef vector<string> vs;
#define sz(a) int((a).size())
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define rep(i,n) for(int i = 0;i < n;++i)
#define foreach(it,c) for(vi::iterator it = (c).begin();it != (c).end();++it)

#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))

struct node{
    node* next;
    char s[81];
}hash[MAXN],*cur,*h[MAXN];
int record[MAXN];  //hash指哈系值跟字符串的对应。 h[mod]是记录的存放的地址.
int n;
/// @brief BKDR Hash Function
    /// @detail 本 算法由于在Brian Kernighan与Dennis Ritchie的《The C Programming Language》一书被展示而得 名，是一种简单快捷的hash算法，也是Java目前采用的字符串的Hash算法（累乘因子为31）。
template<class T>
size_t BKDRHash(const T *str)
{
    register size_t hash = 0;
    while (size_t ch = (size_t)*str++)
    {
        hash = hash * 131 + ch;
    }
    return (hash&0x7fffffff)%MOD;
}
int getID(const char*s){
    int code = BKDRHash(s);
    node *p = h[code];
    while(p){
        if(!strcmp(s,p->s))
            return p-hash;
        else p=p->next;
    }
    strcpy(cur->s,s);
    cur->next=h[code];
    h[code]=cur++;
    return cur-hash-1;
}

int main(){
    //freopen("1004.in","r",stdin);
    int n,Max,j,temp,i;
    char s[100];
    while(scanf("%d",&n)&&n){
        clr(hash,0);
        clr(record,0);
        clr(h,0);
        cur=hash;temp=Max=0;
        while(n--){
            scanf("%s",s);
            i = getID(s);
            j= ++record[i];
            if(j>Max){
                Max=j,temp=i;
            }
        }
        printf("%s\n",hash[temp].s);
    }
    return 0;
}