SDUT 3379 数据结构实验之查找七：线性之哈希表

点击打开题目链接

#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;
scanf("%d", &key);
while(1)
{
int k = (key + ans) % m;
if(Hash[k] == 0)
{
Hash[k] = key;
Q.push(k);
break;
}
else if(Hash[k] == key)
{
Q.push(k);
break;
}
else
{
ans++;
}
}
}
cout << Q.front();
Q.pop();
while(!Q.empty())
{
cout << ' ' << Q.front();
Q.pop();
}
cout << endl;
}
return 0;
}