C Implementation of Problem 10

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

uint64_t p0010()

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 10

This is where my prime infrastructure shows its weak points, since the C version doesn't have a sieve.

Problem:

The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.

Find the sum of all the primes below two million.
*/
#ifndef EULER_P0010
#define EULER_P0010
#include <stdint.h>
#include <inttypes.h>
#include <stdio.h>
#include "include/macros.h"
#include "include/primes.h"

uint64_t EMSCRIPTEN_KEEPALIVE p0010() {
    uint64_t tmp, answer = 0;
    prime_sieve ps = prime_sieve0();
    while ((tmp = next(ps)) < 2000000)
        answer += tmp;
    free_prime_sieve(ps);
    return answer;
}

PROGRAM_TAIL("%" PRIu64, p0010)
#endif

Tags: c-iterator, prime-number