开放寻址法 Hash

//拉链法
#include<iostream>
#include<cstring>

using namespace std;

const int N = 2000003, null = 0x3f3f3f3f;

int h[N];

int find(int x)//k有两个含义，如果x在hash中就是其下标，若不在hash表中就是应该存放的位置
{
    int k = (x % N + N) % N;

    while(h[k] != null && h[k] != x)
    {
        k++;
        if(k == N) k = 0;
    }

    return k;
}

int main()
{
    int n;
    scanf("%d",&n);

    memset(h,0x3f3f3f3f,sizeof(h)); 

    while(n--)
    {
        char op[2];
        int x;
        scanf("%s%d",op,&x);

        int k = find(x);
        if(*op == 'I')  h[k] = x;
        else{
            if(h[k] != null ) puts("Yes");
            else  puts("No");
        }
    }
    return 0;
}