1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
///
/// @file count_primes1.cpp
/// @brief Count the primes up to 10^9.
///
/// Copyright (C) 2018 Kim Walisch, <kim.walisch@gmail.com>
///
/// This file is distributed under the BSD License. See the COPYING
/// file in the top level directory.
///
#include <primesieve/ParallelSieve.hpp>
#include <stdint.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <cmath>
using namespace std;
using namespace primesieve;
/// Correct pi(x) values to compare with test results
const uint64_t pix[9] =
{
4, // pi(10^1)
25, // pi(10^2)
168, // pi(10^3)
1229, // pi(10^4)
9592, // pi(10^5)
78498, // pi(10^6)
664579, // pi(10^7)
5761455, // pi(10^8)
50847534 // pi(10^9)
};
void check(bool OK)
{
cout << " " << (OK ? "OK" : "ERROR") << "\n";
if (!OK)
exit(1);
}
int main()
{
cout << left;
ParallelSieve ps;
ps.setStart(0);
ps.setStop(0);
uint64_t count = 0;
// pi(x) with x = 10^i for i = 1 to 9
for (int i = 1; i <= 9; i++)
{
count += ps.countPrimes(ps.getStop() + 1, (uint64_t) pow(10.0, i));
cout << "pi(10^" << i << ") = " << setw(12) << count;
check(count == pix[i - 1]);
}
cout << endl;
cout << "All tests passed successfully!" << endl;
return 0;
}
|
