1078 Hashing （25 分）

最新推荐文章于 2020-03-31 09:48:15 发布

原创最新推荐文章于 2020-03-31 09:48:15 发布 · 199 阅读

0 ·

CC 4.0 BY-SA版权

本文探讨了在哈希表中使用平方探测方法解决冲突的问题。输入一组正整数，若用户定义的表大小非素数，则调整为下一个素数。通过平方探测找到每个数的正确位置，并输出其在表中的位置。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 TSizeis 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 -

题目大意：输入msize和N,如果msize不是素数的话就把msize变为比当前值大的最小素数，采用平方探测方法，求插入哈希表后元素的序号

#include<bits/stdc++.h>
using namespace std;
bool isPrime(int n)
{
if(n==0||n==1)
return false;
for(int i=2;i*i<=n;i++)
if(n%i==0)
return false;
return true;
}
int main()
{
int msize,n,x,num=0;
cin>>msize>>n;
while(!isPrime(msize))
msize++;
vector<int>v(msize);
for(int i=0;i<n;i++)
{
cin>>x;
int flag=0,pos;
for(int j=0;j<msize;j++)
{
pos=(x+j*j)%msize;
if(v[(x+j*j)%msize]==0)
{
v[(x+j*j)%msize]=x;
flag=1;
break;
}
}
if(i!=n-1)
{
if(flag)
cout<<pos<<" ";
else cout<<"- ";
}
else
{
if(flag)
cout<<pos;
else cout<<"-";
}
}
}