关闭

PAT 1078. Hashing (25)

标签: 1078-Hash
156人阅读 评论(0) 收藏 举报
分类:

今天打算把当年没有做对的几道题重新做一下。才发现自己有多么的low。
先把这道简单的题贴出来:
1078. Hashing (25)

时间限制
100 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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 (<=104) 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 -

很简单的题目,为啥一直最后一个case没过呢!
因为这个“Quadratic probing”!二次探测法!要哭了,不认识这个单词~
二次探测法的公式: hi=(h(key)+i*i)%m 0≤i≤m-1 //即di=i2
   即探查序列为d=h(key),d+12,d+22,…,等。
然后加上这个就过了~

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
bool isPrime(int n)
{
  if(n == 1)
    return false;
  if(n == 2 || n == 3)
    return true;
  for(int i = 2; i <= sqrt(n); i++)
    if(n%i == 0)
      return false;
    return true;
}

int main()
{
  int MSize,N;
  while(cin>>MSize>>N)
  {
    while(!isPrime(MSize))
      MSize++;
    int a;
    bool table[10003];
    memset(table,false,sizeof(table));
    for(int i = 0; i < N; i++)
    {
      cin>>a;
      int j = 0;
      for(j = 0; j < MSize; j++)
      {
        int d = (a + j * j);
        if(table[d%MSize] == false)
        {
        cout<<d%MSize;
        table[d%MSize] = true;
          break;
        }
      }
      if( j == MSize)
        cout<<'-';
      if(i != N-1)
        cout<<' ';
      else
        cout<<endl;
    }
  }
  return 0;
}
0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:23322次
    • 积分:677
    • 等级:
    • 排名:千里之外
    • 原创:46篇
    • 转载:35篇
    • 译文:0篇
    • 评论:1条
    文章分类
    最新评论