poj 2503 字符串hash

题目链接：http://poj.org/problem?id=2503

代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>

using namespace std;

const int maxn = ;
const int HASH = ;

int head[HASH],next[maxn];
char s1[maxn][],s2[maxn][];
int n;

int hash(char *s)
{
    int ret = ;
    int seed = ;
    while(*s)
    {
        ret = ret * seed + *(s++);
    }
    return (ret & 0x7fffffff) % HASH;
}

int search(char *s)
{
    int i;
    int id = hash(s);
    for(i=head[id]; i!=-; i=next[i])
    {
        if(strcmp(s,s2[i]) == )
            break;
    }
    return i;
}

void input()
{
    memset(head,-,sizeof(head));
    n = ;
    char ch[];
    gets(ch);
    while(ch[] != '\0')
    {
        int i=,j;
        for(i=,j=; ch[i]!=' '; i++,j++)
            s1[n][j] = ch[i];
        s1[n][j] = '\0';
        i++;
        for(j=; ch[i]!='\0'; i++,j++)
            s2[n][j] = ch[i];
        s2[n][j] = '\0';

        int id = hash(s2[n]);
        next[n] = head[id];
        head[id] = n;
        n++;
        gets(ch);
    }
}

void solve()
{
    char ch[];
    while(scanf("%s",ch) == )
    {
        int id = search(ch);
        if(id == -)
        {
            printf("eh\n");
        }
        else
        {
            printf("%s\n",s1[id]);
        }
    }
}
int main()
{
  //  freopen("E:\\acm\\input.txt","r",stdin);
    input();
    solve();
}