1078 Hashing

解题代码

#include<cstdio>
#include<cmath>
const int nmax = 20000;
bool prime[nmax];
bool isPrime(int x);
int NextPrime(int x);
int main() {
	int n, m, temp, j;
	scanf("%d%d", &n, &m);
	if (!isPrime(n)) n = NextPrime(n);
	for (int i = 0; i < m; i++) {
		if (i) printf(" ");
		scanf("%d", &temp);
		if (prime[temp%n] == false) {
			prime[temp%n] = true;
			printf("%d", temp%n);
		}
		else {
			for (j = 1; j <= n; j++) {
				int p = (temp%n + j*j) % n;
				if (prime[p] == false) {
					prime[p] = true;
					printf("%d", p);
                    break;
				}
			}
			if (j == n + 1) printf("-");
		}
	}
	return 0;
}
bool isPrime(int x) {
	if (x <= 1) return false;
	for (int i = 2; i <= sqrt(x); i++)
		if (x % i == 0) return false;
	return true;
}
int NextPrime(int x) {
	int n = x + 1;
	while (1) {
		if (isPrime(n)) return n;
		else n++;
	}
}

测试结果

问题整理

1.素数。