1078. Hashing (25)
2016-11-30 08:47
309 查看
1078. Hashing (25)
注意:题目要求用二次探测法(Quadratic probing)解决冲突
注意:题目要求用二次探测法(Quadratic probing)解决冲突
#include <bits/stdc++.h> int hash[11024]; int isprime(int n) { if(n==1) return false; for(int i=2;i*i<=n;++i) if(n%i==0) return false; return true; } int main() { int msize,n; scanf("%d %d",&msize,&n); while(!isprime(msize)) ++msize; while(n--) { int e,i; scanf("%d",&e); for(i=0;i<msize;++i) { if(!hash[(e+i*i)%msize]) { hash[(e+i*i)%msize]=e; printf("%d",(e+i*i)%msize); break; } } if(i==msize)printf("-"); if(n)printf(" "); } return 0; }
相关文章推荐
- 1078. Hashing (25)
- 1078. Hashing (25)
- 1078. Hashing (25)哈希二次碰撞探测
- PAT 1078 Hashing (25)
- 1078. Hashing (25)
- 1078. Hashing (25)【Hash + 探測】——PAT (Advanced Level) Practise
- 1078. Hashing (25):二次探测法哈希查找
- 1078. Hashing (25) PAT
- PAT (Advanced Level) Practise 1078 Hashing (25)(平方探测)
- 1078. Hashing (25)-PAT甲级真题(二次方探查法)
- 1078. Hashing (25)
- 1078. Hashing (25)
- 1078. Hashing (25)
- 1078. Hashing (25)
- PAT1078 Hashing (25)
- PAT 1078-Hashing (25)
- 1078. Hashing (25)解题报告
- 1078. Hashing (25)
- 1078. Hashing (25)
- 1078. Hashing (25)