#include <iostream>
#include <string.h>
using namespace std;
int prime[15000],p,temp,pos;
bool flag[15000],isFilled[15000];
int Msize,N,outputNum=0;
int SolvePrime(int m)
{
memset(isFilled,false,sizeof(isFilled));
memset(flag,true,sizeof(flag));
for(int i=2;i<15000;i++)
{
if(flag[i]==true)
{
prime[p++]=i;
for(int j=i;j<15000;j+=i)
flag[j]=false;
}
}
int i=0;
while(m>prime[i])
i++;
return prime[i];
}
int main()
{
scanf("%d%d",&Msize,&N);
Msize=SolvePrime(Msize);
for(int i=0;i<N;i++)
{
scanf("%d",&temp);
pos=temp%Msize;
if(isFilled[pos]==false)
{
isFilled[pos]=true;
if(outputNum==0)
cout<<pos;
else
cout<<" "<<pos;
outputNum++;
}
else
{
int z=1,j;
for(j=(pos+z*z)%Msize;z<Msize;j=(pos+z*z)%Msize)
{
if(isFilled[j]==false)
{
isFilled[j]=true;
if(outputNum==0)
cout<<j;
else
cout<<" "<<j;
outputNum++;
break;
}
z++;
}
if(z==Msize)
{
if(outputNum==0)
cout<<"-";
else
cout<<" -";
outputNum++;
}
}
}
return 0;
}
hash的过程,做这题要知道二次探查法Quadratic probing (with positive increments only)的公式:
hash[num] = (num+z*z)%Msize z>=0&&z<=Msize