Sum of Primes Below a Limit

A prime is an integer greater than 1 divisible only by 1 and itself. Add every prime strictly smaller than limit. The limit itself is excluded even when it is prime.

Implement prime_sum(limit).

Input

limit: The exclusive upper bound.

Output

Return the sum of the eligible primes, or 0 when none exist.

Vincoli

0 ≤ limit ≤ 2,000,000. Return the sum using a signed 64-bit integer.

Esempi

Input:
limit = 12

Output atteso:
expected = 28

Input:
long long limit = 12;

Output atteso:
long long expected = 28;

Input:
long limit = 12;

Output atteso:
long expected = 28;

Input:
limit = 2

Output atteso:
expected = 0

Input:
long long limit = 2;

Output atteso:
long long expected = 0;

Input:
long limit = 2;

Output atteso:
long expected = 0;

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

• #10 Summation of Primes