PAT (Advanced Level) Practice A1078 Hashing （25 分）(C++)（甲级）（哈希表，二次探测）

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:

4 4
10 6 4 15
Sample Output:

0 1 4 -

using namespace std;
#include
#include
#include
#include
#include 
#include 

bool isPrime(int x)//判断是否是质数
{
    if(x <=1 || x > 2 && x%2 == 0) return false;
    int sqr = (int)sqrt(x*1.0);
    for(int i=3; i<=sqr; i+=2)
    {
        if(x%i == 0) return false;
    }
    return true;
}

bool P[10010] = {0};//哈希表，若该位已存入数据则置1

int main()
{
    int M, N, key, H;
    scanf("%d %d", &M, &N);
    while(!isPrime(M)) M++;//重置哈希表大小
    for(int i=0, j; i<N; i++)
    {
        scanf("%d", &key);
        key %= M, H = key;
        for(j=0; P[H] && j<M; j++, H = (key+j*j)%M);//二次平方探测
        if(i) printf(" ");//打印注意输出格式
        if(P[H]) printf("-");
        else printf("%d", H), P[H] = 1;
    }
	return 0;
}