1078 Hashing （25 分）-白红宇

1078 Hashing （25 分）

阅读量：4977 次

发布时间：2019-06-12

本文共 1892 字，大约阅读时间需要 6 分钟。

1078 Hashing （25 分）

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

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:

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 410 6 4 15

Sample Output:

0 1 4 - 思路：

#include
        
         #include
         
          #include
          
           #include
           
            #include
            
             #include
             #include
              
               #include
               
                #include
                
                 #include
                 
                  #include 
                  
                   #include
                   
                    using namespace std;int findPrim(int mSize){ for(int num=mSize;;num++) { bool flag=true; if(num==1) continue; for(int i=2;i<=sqrt(num);i++) { if(num%i==0) flag=false; } if(flag) { return num; } }}int main(){ int mSize,n; scanf("%d%d",&mSize,&n); int len=findPrim(mSize>n?mSize:n); int a[len]; //cout<
                    
                     <

result; for(int i=0;i

转载于:https://www.cnblogs.com/zhanghaijie/p/10329759.html

你可能感兴趣的文章