散列查找+二次探测法 1078 Hashing (25分)

最新推荐文章于 2023-02-08 23:15:00 发布

原创

最新推荐文章于 2023-02-08 23:15:00 发布 · 371 阅读

1 ·

CC 4.0 BY-SA版权

本问题要求使用散列插入一系列互不相同的正整数，并输出它们在散列表中的位置。散列函数定义为 H(key) = key % TSize，其中 TSize 是散列表的最大大小。解决冲突的方法是采用二次探测法（仅使用正增量）。如果用户给出的最大大小不是素数，需将表大小重新定义为大于用户给定大小的最小素数。输入包括用户定义的表大小和要插入的数字数量，以及接下来的一行包含这些数字。输出是这些数字在表中的位置，如果无法插入则打印“-”。

1078 Hashing (25分)

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 (≤10
4
) 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.

Output Specification:
For each test case, print the corresponding positions (index starts from 0) of the input numbers in one line. All the numbers in a line are separated by a space, and there must be no extra space at the end of the line. In case it is impossible to insert the number, print “-” instead.

Sample Input: