问题描述： 设计哈希表实现电话号码查询系统。

基本要求：

1、设每个记录有下列数据项：电话号码、用户名、地址；

2、从键盘输入各记录，分别以电话号码和用户名为关键字建立哈希表；

3、采用再哈希法解决冲突；

4、查找并显示给定电话号码的记录；

5、查找并显示给定用户名的记录。

6、在哈希函数确定的前提下，尝试各种不同类型处理冲突的方法（至少两种），考察平均查找长度的变化。

-Problem Descr iption: Design hash table to achieve telephone number inquiry system. Basic requirements: 1, for each record the following data items: telephone numbers, user name, address　2, from the keyboard input of the records, respectively, telephone number and user name to establish Hashtable keywords　3, using recycled Kazakhstan Greek law to resolve conflicts　4, find and display a given telephone number of record　5, find and display a given user name records. 6, in the hash function to determine, under the premise of trying to deal with different types of conflict (at least two), visit Find the length of the average change.