代码如下：

#include <iostream>
#include <vector>
using namespace std;
const int N = 10005;struct node {char name[35];
};unsigned int BKDRHash(char *str) {unsigned int key = 0, seed = 31;while (*str) {key = key * seed + (*str++);}return key & 0x7fffffff;
}vector<node>List[N];//这里要为N，因为%N，所以要N，开小的话程序就会出问题。
//List的作用：把冲突的hash值存起来
int main() {int n, key ;cin >> n;node t;for (int i = 1; i <= n; i++) {cin >> t.name;key = BKDRHash(t.name) % N;//计算hash值，并求余List[key].push_back(t);}int cnt;cin >> cnt;//查询次数while (cnt--) {bool flag = false;char s[35];cin >> s;key = BKDRHash(s) % N;for (int i = 0; i < List[key].size(); i++) {if (strcmp(List[key][i].name, s) == 0) {cout << "yes" << endl;flag = true;break;}}if (!flag)cout << "no" << endl;}return 0;
}