zoukankan      html  css  js  c++  java
  • PAT (Advanced Level) Practice

    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 (<=10^4^) 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 -

    题目大意:求每个数的哈希值,并用平方探测来解决哈希冲突
    #include<iostream>
    #include<vector>
    using namespace std;
    bool isprime(int a){
      if(a<2) return false;
      for(int i=2; i*i<a+1; i++)
      if(a%i==0) return false;
      return true;
    }
    int main(){
      int m, n, i, temp;
      cin>>m>>n;
      bool flag=false;
      for(i=m; ; i++){
        if(isprime(i)){m=i; break;}
      }
      vector<int> v(m, -1);
      for(i=0; i<n; i++){
        cin>>temp;
        int index=temp%m;
        if(v[index]==-1){
          if(!flag){cout<<index; flag=true;}
          else cout<<" "<<index;
          v[index]=1;
        }else{
          int j=1;
          while(v[(index+j*j)%m]!=-1 && (index+j*j)<=m*m){j++;}
          index+=j*j;
          index%=m;
          if(v[index]==-1){cout<<" "<<index; v[index]=1;}
          else cout<<" -";
        }
      }
      return 0;}
    有疑惑或者更好的解决方法的朋友,可以联系我,大家一起探讨。qq:1546431565
  • 相关阅读:
    谈谈final, finally, finalize的区别。
    session是存储在什么地方,以什么形式存储的
    如果有几千个session,怎么提高效率
    堆和栈的区别?
    进程和线程的区别?
    Delphi中启动项管理 已安装程序卸载简单组件
    在使用TStringlist谨慎使用For循环
    Delphi 中窗体全屏组件
    TEdit扩展:做成多按钮的Edit,可用作浏览器地址栏
    Delphi 7中处理TEdit鼠标进入 离开事件
  • 原文地址:https://www.cnblogs.com/mr-stn/p/9157756.html
Copyright © 2011-2022 走看看