zoukankan      html  css  js  c++  java
  • 1145 Hashing

    The task of this problem is simple: insert a sequence of distinct positive integers into a hash table first. Then try to find another sequence of integer keys from the table and output the average search time (the number of comparisons made to find whether or not the key is in the table). 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 3 positive numbers: MSize, N, and M, which are the user-defined table size, the number of input numbers, and the number of keys to be found, respectively. All the three numbers are no more than 1. Then N distinct positive integers are given in the next line, followed by M positive integer keys in the next line. All the numbers in a line are separated by a space and are no more than 1.

    Output Specification:

    For each test case, in case it is impossible to insert some number, print in a line X cannot be inserted. where X is the input number. Finally print in a line the average search time for all the M keys, accurate up to 1 decimal place.

    Sample Input:

    4 5 4
    10 6 4 15 11
    11 4 15 2
     

    Sample Output:

    15 cannot be inserted.
    2.8

    题解:
    hash查找,平方探测

    #include<bits/stdc++.h>
    using namespace std;
    const int maxn=1010;
    bool isP(int n){
        for(int i=2;i<n;i++){
            if(n%i==0){
                return false;
            }
        }
        return true;
    }
    int main(){
        int key,h;
        int MS,N,M,cnt=0;
        scanf("%d %d %d",&MS,&N,&M);
        while(!isP(MS)){
            MS++;
        }
        vector<int> v;
        int flag=0;
        v.resize(MS);
        for(int i=0;i<N;i++){
            scanf("%d",&key);
            flag=0;
            for(int j=0;j<MS;j++){
                h=(key+j*j)%MS;
                if(v[h]==0){
                    flag=1;
                    v[h]=key;
                    break;
                }
            }
            if(flag==0){
                printf("%d cannot be inserted.
    ",key);
            }
        }
        cnt=0;
        for(int i=0;i<M;i++){
            scanf("%d",&key);
            for(int j=0;j<=MS;j++){
                h=(key+j*j)%MS;
                cnt++;
                if(v[h]==key||v[h]==0){
                    break;
                }
            }
        }
        printf("%.1lf
    ",cnt*1.0/M);
        return 0;
    
    }



  • 相关阅读:
    安装Mysql或者msi文件时遇到2502/2503错误
    学习Redis之set集合类型详解
    学习Redis之List列表类型详解
    学习Redis之String字符串类型详解
    学习Redis之redis的基础知识
    学习Redis之Benchmark性能测试
    学习Redis之什么是Redis
    学习Redis之为什么要使用Nosql
    Java基础之使用多线程处理多客户端请求
    代码层实现质量属性战术
  • 原文地址:https://www.cnblogs.com/dreamzj/p/14413781.html
Copyright © 2011-2022 走看看