Python实现Pat 1078. Hashing (25)
来源:互联网 发布:淘宝网外贸男装单肩包 编辑:程序博客网 时间:2024/05/17 07:10
Pat 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 4
10 6 4 15
Sample Output:
0 1 4 -
提交的代码
def IsPrime(num): if num==1: return False elif num==2: return True elif(num%2==0): return False temp = num**0.5 for i in range(3,int(temp+1),2): if num%i==0: return False return Trueline0= [int(x) for x in raw_input().split(' ')]line1= [int(x) for x in raw_input().split(' ')]MSize,N=line0[0],line0[1]while not IsPrime(MSize): MSize+=1bList=[False]*(MSize)for i in range(N): temp=line1[i] for j in range(MSize): index=(temp+j*j)% MSize if bList[index]==False: print index, bList[index]=True break else: print '-',
评测结果
在PAT上提交后发现有一项运行超时了,但在牛客网是都可以通过的。
PAT
牛客网
- Python实现Pat 1078. Hashing (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)
- PAT 1078. Hashing (25)
- 【PAT】1078. Hashing (25)
- 1078. Hashing (25) PAT
- pat 1078. Hashing (25)
- PAT 1078. Hashing (25)
- PAT 1078.Hashing (25)
- PAT 1078. Hashing (25)
- PAT (Advanced) 1078. Hashing (25)
- PAT A 1078. Hashing (25)
- PAT(A) - 1078. Hashing (25)
- 1078. Hashing (25) PAT甲级
- 正则之grep
- unity 触摸事件 移动,缩放,以及相机移动超出边界
- android /JAVA下不错的自定义log类
- 兑换钱
- mysql添加外键失败:sql Cannot add or update a child row:a foreign key constraint fails
- Python实现Pat 1078. Hashing (25)
- 清理注册表脚本
- easyui-datagrid自适应
- yum安装
- JS中的异步以及事件轮询机制
- Python脚本在Windows下后台运行
- App测试方法总结
- 页面定时跳转的扩展 使用JS完成读秒的效果
- hibernate框架多对多(十七)