哈希表模板(Hash set)

namespace Hash_Table{
#define inf ~0U>>1
#define MaxN 10010
    struct Linker{
        int hash,val;
        Linker *next;
        Linker(int _,Linker *__) : hash(_),val(inf),next(__) {}
    }*fir[MaxN];

    int &Hash(int x){
        int pos=x%MaxN;
        for(Linker *iter=fir[pos];iter;iter=iter->next)
            if(iter->hash==x)
                return iter->val;
        return (fir[pos]=new Linker(x,fir[pos]))->val;
    }
}