int main() {
// Initialize relevant variables and count 2 as a prime
int circular_primes = 1;
euler::PrimeSieve sieve(kLimit);
// Check odd numbers for circular primality
for (int i = 3; i < kLimit; i += 2)
if(is_circular_prime(i, sieve)) circular_primes++;
std::cout << circular_primes << std::endl;
}
int main(void) {
int i, count = 0;
memset(prime, 0, sizeof(prime));
prime[1] = 'P'; /* 2 is Prime */
for (i = 2; i < N; i+=2)
if (is_prime_1(i+1)) prime[i] = 'P';
for (i = 0; i < N; ++i)
if (is_circular_prime(i+1)) ++count;
printf("%d\n", count);
return 0;
}
