【PAT】【Advanced Level】1078. Hashing (25)
来源:互联网 发布:手机电视直播软件排名 编辑:程序博客网 时间:2024/06/03 06:58
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 "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 410 6 4 15Sample Output:
0 1 4 -
https://www.patest.cn/contests/pat-a-practise/1078
https://www.nowcoder.com/pat/5/problem/4308
题目大意:
哈希,冲突用二次探测法解决
Quadratic probing(二次探测法)
吃了英语渣的亏。。
思路:
普通的哈希加上二次探测法的冲突处理
CODE:
#include<iostream>#include<map>using namespace std;map<int,int> ma;int prime(int n){if (n==0||n==1) return 0;if (n==2||n==3) return 1;for (int i=2;i*i<=n;i++)if (n%i==0) return 0;return 1;}int main(){int pri,n;cin>>pri>>n;while (!prime(pri)){pri++;}//cout<<pri<<endl;int t;for (int i=0;i<n;i++){cin>>t;int tt=t%pri;if (ma[tt]==0){cout<<tt;ma[tt]=1;}else{int fl=0;for (int j=1;j<=pri;j++){tt=(t+j*j)%pri;if (ma[tt]==0){cout<<tt;ma[tt]=1;fl=1;break;}}if (fl==0)cout<<"-";}if (i!=n-1)cout<<" ";}return 0;}
- PAT Advanced Level 1078. Hashing(25)
- 【PAT】【Advanced Level】1078. Hashing (25)
- PAT (Advanced Level) 1078. Hashing (25) 哈希,二次探测法
- PAT (Advanced Level) Practise 1078 Hashing (25)
- PAT (Advanced) 1078. Hashing (25)
- PAT (Advanced Level) Practise 1078 Hashing (25)(平方探测)
- 1078. Hashing (25)【Hash + 探测】——PAT (Advanced Level) Practise
- Pat(Advanced Level)Practice--1078(Hashing)
- 【PAT Advanced Level】1025. PAT Ranking (25)
- PAT Advanced Level 1075. PAT Judge (25)
- 【PAT】【Advanced Level】1025. PAT Ranking (25)
- 【PAT】【Advanced Level】1075. PAT Judge (25)
- PAT 1078. Hashing (25)
- pat 1078. Hashing (25)
- PAT 1078. Hashing (25)
- PAT 1078. Hashing (25)
- PAT 1078. Hashing (25)
- PAT 1078. Hashing (25)
- hff如何开启windows远程
- [BFS] Codeforces Round #407 (Div. 1) 788C. The Great Mixing
- ApplicationThread 代理启动
- VS中常用C#代码段快速输入
- golang常见的几种并发模型框架
- 【PAT】【Advanced Level】1078. Hashing (25)
- uva11248isap模板(超级版)
- apache web server-性能测试和负载均衡
- 滴滴笔试:最大连续子数组
- ODI(Oracle Data Integrator)基本使用教程(1)
- Sql中Join的用法图解
- RQNOJ 201 奥运大包围
- 数据库Sharding的基本思想和切分策略
- 为什么做java的web开发我们会使用struts2,springMVC和spring这样的框架?