Not Only Algorithm,不仅仅是算法,关注数学、算法、数据结构、程序员笔试面试以及一切涉及计算机编程之美的内容 。。
你的位置:NoAlGo博客 » 题解 » 

PAT 1078. Hashing

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 -


#include <cstdio>

const int mxsz = 100000; 
int a[mxsz] = {0};

bool isprime(int x)
	if (x == 0 || x == 1) return 0;
	if (x == 2) return 1;
	for (int i = 2; i * i <= x; i++)
		if (x % i == 0) return 0;
	return 1;

int main()
	int n, m; scanf("%d%d", &n, &m);	
	while (!isprime(n)) n++;

	for (int i = 0; i < m; i++)
		int x; scanf("%d", &x);
		int pos = x % n;
		for (int j = 0, t; j < m; j++)
			if (a[t = (pos + (long long)j * j) % n] == 0)
				pos = t; break;

		if (i > 0) printf(" ");
		if (a[pos] == 0) a[pos] = 1, printf("%d", pos);
		else printf("-");

	return 0;
上一篇: 下一篇: