PAT 1078. Hashing (25)

原创 2015年07月07日 14:32:27

今天打算把当年没有做对的几道题重新做一下。才发现自己有多么的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;
}

相关文章推荐

pat-a1078. Hashing (25)

快考试了本来只想a个水题。。。。没看到Quadratic probing也不知道这个是二次探查法的意思然后最后一个点一直没过。。。英语要继续多记单词才行 #include #include in...

PAT (Advanced Level) Practise 1078 Hashing (25)

1078. Hashing (25) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B ...

pat 1078. Hashing (25)

时间 结果 得分 题目 语言 用时(ms) 内存(kB) 用户 7月25日 14:57 答案正确 25 1078 ...

PAT 1078-Hashing (25)

时间限制 1000 ms 内存限制 65536 KB 代码长度限制 100 KB 判断程序 Standard 题目描述 The task of this problem is simple...

PAT 1078.Hashing (25)

PAT1078

1078. Hashing (25)【Hash + 探测】——PAT (Advanced Level) Practise

题目信息1078. Hashing (25)时间限制100 ms 内存限制65536 kB 代码长度限制16000 B The task of this problem is simple: i...

【PAT】1078. Hashing (25)

The task of this problem is simple: insert a sequence of distinct positive integers into a hash tabl...

1078. Hashing (25)-PAT甲级真题(二次方探查法)

1078. Hashing (25) The task of this problem is simple: insert a sequence of distinct positive integ...
  • liuchuo
  • liuchuo
  • 2016年08月20日 21:05
  • 144

PAT-A 1078. Hashing (25)

给出表长m和要插入的元素个数n,以及n个要插入的元素,讲这些元素按照顺序插入散列表中,其中散列函数为H(key) = key%m,解决冲突的策略采用正想增加的二次探测法。 若给出的表长m不是素数,则...

1078. Hashing (25)

aaaa 不知道为什么用二次探测竟然还不能过公共点 #include using namespace std; bool isPr(int mm){ if(mm==1) return false...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:PAT 1078. Hashing (25)
举报原因:
原因补充:

(最多只允许输入30个字)