哈希表（开放定址法处理冲突）(1013)

#include<iostream>
#include<cstdlib>
using namespace std;
typedef struct
{
    int data;
    int len, n;
}HashTable;
HashTable ha[101],Ha;
void InsertHT()
{
    int adr, k, cur = 0;
    cin >> k;
    adr = k%Ha.len;
    if (ha[adr].data == -1)
        ha[adr].data = k;
    else
    {
        while (ha[adr].data != -1 && cur < Ha.len)
        {
            adr = (adr + 1) % Ha.len;
            cur++;
        }
        ha[adr].data = k;
    }
}
void CreateHT(int len, int n)
{
    int i;
    Ha.len = len, Ha.n = n;
    for (i = 0; i < n; i++)
        ha[i].data = -1;
    for (i = 0; i < n; i++)
        InsertHT();
}
void Search(int x)
{
    int adr = x%Ha.len;
    int cnt = 1; int k = 0;
    while (ha[adr].data != -1 && ha[adr].data != x&&k<Ha.len)
    {
        cnt++;
        adr = (adr + 1) % Ha.len;
        k++;
    }
    if (ha[adr].data == x)
        cout << adr << ‘,‘ << cnt;
    else
        cout << -1;
}
int main()
{
    int len, n, x;
    cin >> len >> n;
    CreateHT(len, n);
    cin >> x;
    Search(x);
    return 0;
}