#include <iostream>
#include <conio.h>
#include <iomanip>
#include <vector>
using namespace std;
const int HashSize = 11;
const int NULLKEY = -1;
int m = 0;
struct HashTable
{
int elem[HashSize]; //存储基址
int count; //元素数目
};
//初始化
void inithash(HashTable &H)
{
m = HashSize;
H.count = m;
for(int i=0; i<H.count; ++i)
{
H.elem[i] = NULLKEY;
}
}
//Hash函数
int Hash(int key)
{
return key % m;
}
//插入
void InsertHash(HashTable &H, int key, int &addr)
{
addr = Hash(key);
while(H.elem[addr] != NULLKEY)
addr = (addr+1) % m;
H.elem[addr] = key;
}
//删除
void DeleteHash(Ha