PAT 1078 Hashing(细心...)

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.

输入描述:
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.

输出描述:
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.

输入例子:
4 4
10 6 4 15

输出例子:
0 1 4 -

总结：这题本身没什么好说的，就是要细心点，一开始Quadratic probing这个词没注意到，以为是非常单纯的哈希表，冲突就输出-，错了一次才知道Quadratic probing 的意思是平方探测。第二次还错了因为自己按着1，-1，4，-4这样子算，第三次又错了，因为自己在第二重循环里用的变量和第一层一样是i，语义混淆了，又是在这里栽坑，if (i) cout << ’ '; 这个输出空格的方式可以学学哈哈，省的还要判断首尾的空格

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e4 + 8;
vector<int>prime;
int a[maxn];
void init()
{
	for (int i = 2; i <  maxn; i++)
	{
		int flag = 1;
		for (int j = 0; j < prime.size(); j++)
			if (i % prime[j] == 0)
				flag = 0;
		if (flag)
			prime.push_back(i);
	}	
}
int main()
{
	init();
	int m, n;
	cin >> m >> n;
	for (int i = 0; i < prime.size() - 1; i++)
	{
		if (m == 1)
			m = 2;
		if (m == prime[i])
			break;
		if (m > prime[i] && m < prime[i + 1])
			m = prime[i+1];
	}
	for (int i = 0; i < n; i++)
	{
		if (i)
			cout << ' ';
		int tem;
		cin >> tem;
		int flag = 0;
		int j;
		for (j = 0; j < m; j++)
		{
			if (a[(tem + j * j) % m] == 0)
			{
				a[(tem + j * j) % m] = 1;
				flag = 1;
				break;
			}
		}
		if (!flag)
			cout << '-';
		else
			cout << (tem + j * j) % m;
	}
}

第三次错误的代码，已修正后，但是这个代码牛客能过，但pat官网过不了，pat上也不给错误案例，就很难受…

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e4 + 8;
vector<int>prime;
int a[maxn];
int b[maxn];
void init()
{
	for (int i = 2; i < maxn; i++)
	{
		int flag = 1;
		for (int j = 0; j < prime.size(); j++)
			if (i % prime[j] == 0)
				flag = 0;
		if (flag)
			prime.push_back(i);
	}
}
int main()
{
	init();
	int m, n;
	cin >> m >> n;
	for (int i = 0; i < prime.size() - 1; i++)
	{
		if (m == 1)
			m = 2;
		if (m == prime[i])
			break;
		if (m > prime[i] && m < prime[i + 1])
			m = prime[i + 1];
	}
	for (int i1 = 0; i1 < n; i1++)	//就是这里...之前是i
	{
		int tem;
		cin >> tem;
		int flag = 0;
		for (int i = 0; i < m; i++)
		{
			if (a[(tem + i * i) % m] == 0)
			{
				a[(tem + i * i) % m] = 1;
				b[i1] = (tem + i * i) % m;
				flag = 1;
				break;
			}
		}
		if (!flag)
			b[i1] = -1;
	}
	for (int i = 0; i < n - 1; i++)
		if (b[i] >= 0)
			cout << b[i] << ' ';
		else
			cout << "- ";
	if (b[n - 1] > 0)
		cout << b[n - 1];
	else
		cout << "-";
}