拉链法（以下为代码）

#include<iostream>
#include<cstring>using namespace std;
const int N=100003;
int h[N],e[N],ne[N];
int n,idx;void insert(int x){int k=(x%N+N)%N;e[idx]=x;ne[idx]=h[k];h[k]=idx++;
}bool find(int x){int k=(x%N+N)%N;for(int i=h[k];i!=-1;i=ne[i]){if(e[i]==x) return true;}return false;
}int main(){scanf("%d",&n);memset(h,-1,sizeof h);while(n--){char op[2];int x;scanf("%s%d",op,&x);if(*op=='I') insert(x);else{if(find(x)) puts("Yes");else puts("No");}}
}

开放寻址法（以下为代码）

#include<iostream>
#include<cstring>
using namespace std;
const int N=200003,null=0x3f3f3f3f;
int h[N];
int n;int find(int x){int k=(x%N+N)%N;while(h[k]!=null && h[k]!=x){k++;if(k>=N) k=0;}return k;
}int main(){scanf("%d",&n);memset(h,0x3f,sizeof h);while(n--){char op[2];int x;scanf("%s%d",op,&x);if(*op=='I'){h[find(x)]=x;}else{if(h[find(x)]==null) puts("No");else puts("Yes");}}
}