PTA整型关键字的平方探测法散列PTA

#include <iostream>
#include <cmath>
#include <vector>
#include <set>
using namespace std;
const int MAX = 1e5;
int n, p;
int findtsize(int a)
{
    if (a == 1)
        return 1; //1 说明他不是素数
    if (a == 2)
        return 0;
    for (int i = 2; i * i <= a; i++)
    {
        if (a % i == 0)
        {
            return 1;
        }
    }
    if (a < 7)
        return 0;
    for (int i = 1;; i++)
    {
        if (4 * i + 3 == a)
            return 0;
        if (4 * i + 3 > a)
            return 1; //是某个4k+3形势的素数可以循环玩整个表
    }
}

int vis[MAX];
int main()
{
    cin >> p >> n;
    while (findtsize(p))
    {
        p++;
    }

    vector<int> v;
    for (int i = 0; i < n; i++)
    {
        int x;
        cin >> x;
        int h = x % p;

        if (vis[h] == 0)
        {
            vis[h] = x;
            v.push_back(h);
        }
        else
        {
            set<int> se;
            int pos = h;
            int cnt = 1;
            int f = 0;
            while (vis[pos] != 0)
            {
                if (se.count(pos))
                {
                    f = 1;
                    break;
                }
                se.insert(pos);
                pos = h + cnt * cnt;
                cnt++;
                if (pos >= p)
                    pos %= p;
            }
            if (f)
            {
                v.push_back(-1);
            }
            else
            {
                vis[pos] = x;
                v.push_back(pos);
            }
        }
    }
    int f = 0;
    for (auto e : v)
    {
        if (f++ != 0)
            cout << ' ';
        if (e == -1)
            cout << "-";
        else
            cout << e;
    }
    return 0;
}