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 -

题意：给出哈希表的容量m和数据的个数n，首先判断m是否是素数，若不是需要先把它转化为大于m的最小素数。输出每个表中在哈希表中的位置，无法插入时输出“-”。 

思路：

• 判读是否为素数：n<2返回false
• 平方探测法的步长为0，1*1，2*2……（m-1）*（m-1）（等于m时和步长为0结果相同）。
• 实时输出即可，if（i）判断在前省事儿~

#include<bits/stdc++.h>
using namespace std;
int vis[10005];
bool isprime(int n) {
	if(n<2) return false;
	for(int i=2; i*i<=n; i++)
		if(n%i==0) return false;
	return true;
}
int main() {
	int m,n,a,res,step;
	scanf("%d%d",&m,&n);
	while(isprime(m)==false) m++;
	for(int i=0; i<n; i++) {
		scanf("%d",&a);
		if(i) printf(" ");
		for(step=0; step<m; step++) {
			res=(a+step*step)%m;
			if(vis[res]==0) {
				vis[res]=1;
				printf("%d",res);
				break;
			}
		}
		if(step>=m) printf("-");
	}
	return 0;
}