解题思路:
按题意模拟,注意平方探测只有正向。
代码如下:
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn = 10000 + 8;
int mp[maxn];
int num[maxn];
int pos[maxn];
bool is_Prime(int x)
{
if(x == 1) return false;
for(int i = 2; i * i <= x; i++)
if(x % i == 0) return false;
return true;
}
int main()
{
int Msize, n;
while(scanf("%d%d", &Msize, &n) == 2)
{
memset(mp, 0, sizeof(mp));
for(int i = 0; i < n; i++) scanf("%d", &num[i]);
for(; ;Msize++)
if(is_Prime(Msize)) break;
for(int i = 0; i < n; i++)
{
int x = num[i];
int cnt = 0;
while(mp[x%Msize])
{
cnt++;
if(cnt > Msize) break;
x = (num[i] + cnt * cnt)%Msize;
}
if(cnt > Msize) pos[i] = -1;
else {pos[i] = x % Msize; mp[x % Msize] = 1;}
}
for(int i = 0; i < n; i++)
{
if(i)
{
if(pos[i] == -1)
printf(" -");
else
printf(" %d", pos[i]);
}
else
{
if(pos[i] == -1)
printf("-");
else
printf("%d", pos[i]);
}
}
printf("\n");
}
return 0;
}