最简单的质数筛

bool is_prime(long long n) {
	if (n == 1) return false;
	bool status = true;
	for (long long i=2; i * i <= n; i++) {
		if (n % i == 0) {
			status = false;
			break;
		}
	}
	return status;
}