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
|
///
/// @file count_primes2.cpp
/// @brief Count the primes within [10^i, 10^i + 10^8]
/// for i = 12 to 19
///
/// Copyright (C) 2024 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.hpp>
#include <primesieve/Vector.hpp>
#include <stdint.h>
#include <cstdlib>
#include <iostream>
#include <iomanip>
using namespace primesieve;
const Array<uint64_t, 6> pix =
{
3618282, // pi[10^12, 10^12+10^8]
3342093, // pi[10^13, 10^13+10^8]
3102679, // pi[10^14, 10^14+10^8]
2893937, // pi[10^15, 10^15+10^8]
2714904, // pi[10^16, 10^16+10^8]
2555873 // pi[10^17, 10^17+10^8]
};
void check(bool OK)
{
std::cout << " " << (OK ? "OK" : "ERROR") << "\n";
if (!OK)
std::exit(1);
}
int main()
{
std::cout << std::left;
uint64_t start = (uint64_t) 1e12;
size_t j = 12;
for (size_t i = 0; i < pix.size(); i++)
{
std::cout << "Sieving the primes within [10^" << j << ", 10^" << j << " + 10^8]" << std::endl;
uint64_t stop = start + (uint64_t) 1e8;
uint64_t count = count_primes(start, stop);
std::cout << "\rPrime count: " << std::setw(7) << count;
check(count == pix[i]);
start *= 10;
j++;
}
std::cout << std::endl;
std::cout << "All tests passed successfully!" << std::endl;
return 0;
}
|
