zoukankan      html  css  js  c++  java
  • PAT 1078 Hashing

    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 ( 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 (≤) and N (≤) 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 -



     1 #include<iostream>
     2 #include<vector>
     3 using namespace std;
     4 bool isprime(int a){
     5   if(a<2) return false;
     6   for(int i=2; i*i<a+1; i++)
     7   if(a%i==0) return false;
     8   return true;
     9 }
    10 int main(){
    11   int m, n, i, temp;
    12   cin>>m>>n;
    13   bool flag=false;
    14   for(i=m; ; i++){
    15     if(isprime(i)){m=i; break;}
    16   }
    17   vector<int> v(m, -1);
    18   for(i=0; i<n; i++){
    19     cin>>temp;
    20     int index=temp%m;
    21     if(v[index]==-1){
    22       if(!flag){cout<<index; flag=true;}
    23       else cout<<" "<<index;
    24       v[index]=1;
    25     }else{
    26       int j=1;
    27       while(v[(index+j*j)%m]!=-1 && (index+j*j)<=m*m){j++;}
    28       index+=j*j;
    29       index%=m;
    30       if(v[index]==-1){cout<<" "<<index; v[index]=1;}
    31       else cout<<" -";
    32     }
    33   }
    34   return 0;}
  • 相关阅读:
    rpm软件包以及rmp命令
    使用ssh-keygen生成密钥对
    从现有的虚拟机创建vagrant box ,再利用新创建的box创建虚拟机
    EXCEL固定行和列
    URL编码
    标准ASCII码
    base64编码
    http学习--URL字符
    浏览器通过http获取服务器资源的过程
    一名程序员过去10年的程序员生涯,给程序员小弟弟小妹妹们的一些总结性忠告
  • 原文地址:https://www.cnblogs.com/mr-stn/p/9581598.html
Copyright © 2011-2022 走看看