Hashing的debug

问题遇到的现象和发生背景

经典题目Hashing。不理解最后一个测试点是什么，为何出错。

问题相关代码，请勿粘贴截图

#include<iostream>
#include<cmath>
using namespace std;
#define msize 10001
struct hashing
{
      int a[msize*3];
      int len;
};

int fun1(int n)  //找质数 
{
    if(n==1) return 2;
    for(int i=2;i<=sqrt(n);i++)
    {
        if(n%i==0)
        return fun1(n+1);
}
return n;
    
} 

void create(hashing &h)
{
    int t,n;
    cin>>t>>n;
    int m=fun1(t);
    int i=0;
    for(i=0;i<m;i++)//哈希表初始化 
     {
    h.a[i]=-1;
    h.len=m;
}

    int d;
    int tmp;
    int j;
    int p;
    for(i=0;i<n;i++)
    {
        cin>>d;
        tmp=d%m;
        if(i!=0) cout<<" ";
        
        if(h.a[tmp]==-1)
        {
        h.a[tmp]=d;
        cout<<tmp;
    }
        else
        {
            for( j=1;j<=m;j++)
            {  p=(tmp+j*j)%m;
                if(h.a[t]==-1)
                 {
                 h.a[t]=d;
                 break;
            }
                else continue;
            }
            if(j>m) 
            {
             cout<<"-";
             }
             else cout<<t;
        }
    }
}

int main()
{   
hashing h;
create(h);
}

运行结果及报错内容

我的解答思路和尝试过的方法

我想要达到的结果

你题目的解答代码如下：

#include <iostream>
#include <cmath>
using namespace std;
#define msize 10001
struct hashing
{
    int a[msize * 3];
    int len;
};

int fun1(int n) //找质数
{
    if (n == 1)
        return 2;
    for (int i = 2; i <= sqrt(n); i++)
    {
        if (n % i == 0)
            return fun1(n + 1);
    }
    return n;
}

void create(hashing &h)
{
    int t, n;
    cin >> t >> n;
    int m = fun1(t);
    int i = 0;
    for (i = 0; i < m; i++) //哈希表初始化
    {
        h.a[i] = -1;
        h.len = m;
    }

    int d;
    int tmp;
    int j;
    int p;
    for (i = 0; i < n; i++)
    {
        cin >> d;
        tmp = d % m;
        if (i != 0)
            cout << " ";

        if (h.a[tmp] == -1)
        {
            h.a[tmp] = d;
            cout << tmp;
        }
        else
        {
            for (j = 1; j <= m; j++)
            {
                p = (tmp + j * j) % m;
                if (h.a[p] == -1)     //t改成p
                {
                    h.a[p] = d;      //t改成p
                    break;
                }
                else
                    continue;
            }
            if (j > m)
            {
                cout << "-";
            }
            else
                cout << p;        //t改成p
        }
    }
}

int main()
{
    hashing h;
    create(h);
}

如有帮助，请点击我的回答下方的【采纳该答案】按钮帮忙采纳下，谢谢!

越
单位 浙江大学
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 (≤10
4
) 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 -