PAT 1078 Hashing（25 分）(哈希+平方探测法)

最新推荐文章于 2022-10-24 20:19:07 发布

littlefox993

最新推荐文章于 2022-10-24 20:19:07 发布

阅读量402

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/weixin_42671353/article/details/82226483

版权

该问题要求在哈希表中插入一系列互不相同的正整数，并输出输入数字的位置。哈希函数定义为 H(key) = key % TSize，其中 TSize 是哈希表的最大大小。使用平方探测法（仅正增量）解决冲突。如果用户给出的最大大小不是质数，需将表大小重新定义为大于用户给出大小的最小质数。

摘要由CSDN通过智能技术生成

The task of this problem is simple: insert a sequence of distinct positive integers into a hash table, and output the positions of the input numbers. The hash function is defined to be H(key)=key%TSize where TSize is the maximum size of the hash table. Quadratic probing (with positive increments only) is used to solve the collisions.

Note that the table size is better to be prime. If the maximum size given by the user is not prime, you must re-define the table size to be the smallest prime number which is larger than the size given by the user.

Input Specification:

Each input file contains one test case. For each case, the first line contains two positive numbers: MSize (≤104) and N (≤MSize) which are the user-defined table size and the number of input numbers, respectively. Then N distinct positive integers are given in the next line. All the numbers in a line are separated by a space.