Hashing - Average Search Time（哈希二次探测再散列

知道如下两个公式：
Hash=key%size
id=(Hash(x)+C)%size
C = 1*1 , -1*1 , 2*2 , -2*2…size*size , -size*size
id就是要将X插入到哈希表里的下标值

第一行是要插入的一个序列，判断会不会冲突
第二行是要查找的序列，求查找次数
最后算出平均查找次数

The task of this problem is simple: insert a sequence of distinct positive integers into a hash table first. Then try to find another sequence of integer keys from the table and output the average search time (the number of comparisons made to find whether or not the key is in the table). 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 3 positive numbers: MSize, N, and M, which are the user-defined table size, the number of input numbers, and the number of keys to be found, respectively. All the three numbers are no more than 10
​4
​​ . Then N distinct positive integers are given in the next line, followed by M positive integer keys in the next line. All the numbers in a line are separated by a space and are no more than 10
​5
​​ .

Output Specification:
For each test case, in case it is impossible to insert some number, print in a line X cannot be inserted. where X is the input number. Finally print in a line the average search time for all the M keys, accurate up to 1 decimal place.

Sample Input:
4 5 4
10 6 4 15 11
11 4 15 2
Sample Output:
15 cannot be inserted.
2.8

#include
using namespace std;
int size;
int h(int num)
{
	return num%size;
}

bool isprime(int num)
{
	if(num<2)return false;
	for(int i=2;i<=sqrt(num);i++)
	{
		if(num%i==0)return false;
	}
	return true;
}
int table[100005];
int main()
{
	int m,n;
	cin>>size>>m>>n;
	while(!isprime(size))size++;
	
	memset(table,-1,sizeof(table));
	
	for(int i=0;i>a;
		
		int id;
		bool found=false;
		for(int j=0;j>a;
		bool found=false;
		for(int j=0;j