C++ (Cpp) is_prime_naive示例

示例#1

文件： Math.cpp 项目： hoxnox/cursord

SizeT
find_ge_prime(SizeT n)
{
	SizeT i = n;
	while (1)
	{
		if (is_prime_naive(i))
			break;
		i++;
	}
	return i;
}

示例#2

文件： project.c 项目： paul-reiners/a-prime-project

int main(int argc, char* argv[]) {
    int n = atoi(argv[1]);
    char* method = argv[2];
    bool is_prime;
    if (strcmp(method, "naive") == 0) {
        is_prime = is_prime_naive(n);
    } else if (strcmp(method, "sieve") == 0) {
        is_prime = is_prime_sieve(n);
    } else if (strcmp(method, "conway") == 0) {
        is_prime = is_prime_conway_simple(n);
    } else {
        printf("%s is not a valid computational method.\n", method);

        return 1;
    }

    printf("%d is %s\n", n, is_prime ? "prime" : "composite");
}