UVa 10282 & POJ 2503 - Babelfish

#include <cstdio>
#include <cstring>
using namespace std;
const int HashSize = 200000;

char eng[110000][30], dic[110000][30];
int head[HashSize], next[HashSize];
int BKDHash(char *c);
int Search(char *s);
void Insert(int s);

int main()
{
//freopen("input.txt", "r", stdin);
int next, i, j, k, l = 1;
bool stopFlag;
char str[20], temp[50];
while (fgets(temp, 50, stdin))
{
if (temp[0] == '\n')
break;
k = 0;
for (i = 0; temp[i] != ' '; i++)
eng[l][i] = temp[i];
eng[l][i] = 0;
for (++i; temp[i] != '\n'; i++)
dic[l][k++] = temp[i];
dic[l][k] = 0;
Insert(l);
l++;
}
while (~scanf("%s", str))
{
int num = Search(str);
if (num == 0)
puts("eh");
else
puts(eng[num]);
}
return 0;
}

int BKDHash(char *c)	//哈希函数。
{
int seed = 131;
int Hash = 0;
for (int i = 0; i < strlen(c); i++)
Hash = Hash * seed + c[i];
return (Hash & 0x7FFFFFFF) % HashSize;
}

void Insert(int s)
{
int v = BKDHash(dic[s]);
next[s] = head[v];	//插入到当前值的首部
head[v] = s;
}

int Search(char *s)
{
int v = BKDHash(s);
int u = head[v];
while (u)
{
if (strcmp(s, dic[u]) == 0)
return u;
u = next[u];
}
return 0;
}