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 (≤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.
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 -
分析:
首先写一个判断素数的函数,然后把题目范围中的数打表出来,根据给的tsize判断是否对应的p[tsize]为true,如果tsize不是负数则向后找,然后得到key,开一个hashtable,初始全为0,表示全部没有被占用,判断h[元素%key],如果为0的话就插入元素,否则进行二次探查,二次探查法是在h[a]出现冲突,题目中为正向解决冲突,我们就考虑h[a+step*step]%key,初始step=1,每次探查step++,如果step自增到key还没有找到,我们则输出‘-’。
代码:
#include<bits/stdc++.h>
using namespace std;
int p[100005]={0};
int h[100005]={0};
bool isprime(int n){
if(n<=1) return false;
int sqr=(int)sqrt(1.0*n);
for(int i=2;i<=sqr;i++){//判断素数从2开始!!
if(n%i==0)
return false;
}
return true;
}
void prime(){
for(int i=2;i<100005;i++){
p[i]=isprime(i);
}
}
int main(){
prime();
int tsize,n;
cin>>tsize>>n;
int key;
if(p[tsize]){
key=tsize;
}else{
int tmp=tsize;
while(p[tmp]==0){
++tmp;
}
key=tmp;
}
for(int i=0;i<n;i++){
int a;
cin>>a;
if(i!=0) cout<<" ";
if(!h[a%key]){
h[a%key]=1;
cout<<a%key;
}else{
int step=1;
for(step=1;step<key;step++){
int k=(a+step*step)%key;
if(h[k]==0){
h[k]=1;
cout<<k;
break;
}
}
if(step>=key){
cout<<"-";
}
}
}
}