SDUT 3377 数据结构实验之查找五：平方之哈希表

点击打开题目链接

#include <bits/stdc++.h>
using namespace std;

int Hash[1010];
int n, m;

int main()
{
    while(~scanf("%d %d", &n, &m))
    {
        queue<int >Q;
        memset(Hash, 0, sizeof(Hash));
        for(int i = 1; i <= n; i++)
        {
            int key;
            int ans = 0;//hash冲突次数
            scanf("%d", &key);
            int num = 0;
            while(1)
            {
                int k = key % m;;
                if(Hash[k] == 0)
                {
                    Hash[k] = key;
                    Q.push(k);
                    break;
                }
                else
                {
                    if(++num%2 == 0)//统计1次冲突,判断奇偶冲突
                    {
                        k = (key+((ans+1)*(ans+1)/4))%m;
                        if(Hash[k] == 0)
                        {
                            Hash[k] = key;
                            Q.push(k);
                            break;
                        }
                    }
                    else
                    {
                        k = (key-(ans*ans/4))%m;
                        if(Hash[k] == 0)
                        {
                            Hash[k] = key;
                            Q.push(k);
                            break;
                        }

                    }
                    ans ++;
                }
            }
        }
        cout << Q.front();
        Q.pop();
        while(!Q.empty())
        {
            cout << ' ' << Q.front();
            Q.pop();
        }
        cout << endl;
    }
    return 0;
}