zoukankan      html  css  js  c++  java
  • 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 -

     1 #include<stdio.h>
     2 #include<math.h>
     3 
     4 int main()
     5 {
     6     int i,MSize,n,j;
     7     bool isprime[10101];
     8     bool isexit[10001];
     9     isprime[1] = false;
    10     for(i=2 ;i<=10100;i++)
    11     {
    12         bool is = true;
    13         for(j=2;j<=sqrt(i*1.0);j++)
    14         {
    15             if(i % j == 0)
    16             {
    17                 is = false;
    18                 break;
    19             }
    20         }
    21 
    22         isprime[i] = is;
    23         //if(is) printf("%d   ",i);
    24     }
    25     while(scanf("%d%d",&MSize,&n)!=EOF)
    26     {
    27         while(isprime[MSize]==false)
    28             ++MSize;
    29 
    30         for(i = 0;i<MSize ;i++)
    31             isexit[i] = false;
    32 
    33         bool fir =true;
    34         for(i =0 ;i<n;i++)
    35         {
    36             int tem;
    37             scanf("%d",&tem);
    38             if(isexit[tem%MSize]==false)
    39             {
    40                 if(fir)
    41                 { 
    42                     printf("%d",tem%MSize);
    43                     fir = false;
    44                 }
    45                 else
    46                 {
    47                     printf(" %d",tem%MSize);
    48                 }
    49                 isexit[tem%MSize] = true;
    50             }
    51             else
    52             {
    53                 bool find = false;
    54                 for(j = 1 ;j <MSize;j++)
    55                 {
    56                     if(isexit[(tem+j*j)%MSize]==false)
    57                     {
    58                         find = true;
    59                         printf(" %d",(tem+j*j)%MSize);
    60                         isexit[(tem+j*j)%MSize] = true;
    61                         break;
    62                     }
    63                 }
    64 
    65                 if(!find)  printf(" -");
    66             }
    67         }
    68 
    69         printf("
    ");
    70     }
    71     return 0;
    72 }
  • 相关阅读:
    前端Vue项目——购物车页面
    vue组件通信传值——Vuex
    django+uwsgi+nginx 导出excel超时问题
    前端Vue项目——登录页面实现
    前端Vue项目——课程详情页面实现
    基于DFA算法、RegExp对象和vee-validate实现前端敏感词过滤
    python的小数据池
    VeeValidate——vue2.0表单验证插件
    前端Vue项目——首页/课程页面开发及Axios请求
    服务配置中心
  • 原文地址:https://www.cnblogs.com/xiaoyesoso/p/4279491.html
Copyright © 2011-2022 走看看