C Implementation of Problem 7

View source code here on GitHub!

Includes

• "primes.h"

• "macros.h" (implicitly, via primes.h)

• "math.h" (implicitly, via primes.h & if compiled on PCC)

• <inttypes.h>

• <stdint.h>

• <stdio.h>

• <stdlib.h> (implicitly, via primes.h & if not compiled on PCC)

• <math.h> (implicitly, via primes.h & if not compiled on PCC)

• <stdbool.h> (implicitly, via primes.h)

Solution

uint32_t p0007()

int main(int argc, char const *argv[])

Note

This function is only present in the Python test runner, or when compiling as a standalone program. It is not present when compiling for the Unity test runner.

/*
Project Euler Problem 7

The prime number infrastructure paid off here

Problem:

By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.

What is the 10 001st prime number?
*/
#ifndef EULER_P0007
#define EULER_P0007
#include <stdint.h>
#include <inttypes.h>
#include <stdio.h>
#include "include/macros.h"
#include "include/primes.h"

uint32_t EMSCRIPTEN_KEEPALIVE p0007() {
    uint32_t answer, count = 0;
    prime_sieve ps = prime_sieve0();
    while (true) {
        answer = next(ps);
        if (++count == 10001)
            break;
    }
    free_prime_sieve(ps);
    return answer;
}

PROGRAM_TAIL("%" PRIu32, p0007)
#endif

Tags: c-iterator, prime-number