Rosetta Code

Square-free integers: Difference between revisions

Page Discussion

Square-free integers (view source)

Revision as of 10:34, 1 July 2020

122 bytes removed ,  3 years ago
m
C++ - renamed class
m (Minor edit to C++ code)
m (C++ - renamed class)
Line 349:
#include <iostream>
#include <string>
#include "sieve_of_eratosthenesprime_sieve.hhpp"
 
using integer = uint64_t;
 
bool square_free(const sieve_of_eratosthenesprime_sieve& sieve, integer n) {
if (n % 4 == 0)
return false;
Line 363:
}
 
void print_square_free_numbers(const sieve_of_eratosthenesprime_sieve& sieve, integer from, integer to) {
std::cout << "Square-free numbers between " << from
<< " and " << to << ":\n";
Line 382:
}
 
void print_square_free_count(const sieve_of_eratosthenesprime_sieve& sieve, integer from, integer to) {
integer count = 0;
for (integer i = from; i <= to; ++i) {
Line 393:
 
int main() {
sieve_of_eratosthenesprime_sieve sieve(1000001);
print_square_free_numbers(sieve, 1, 145);
print_square_free_numbers(sieve, 1000000000000LL, 1000000000145LL);
Line 404:
}</lang>
 
Contents of sieve_of_eratosthenesprime_sieve.hhpp:
<lang cpp>#ifndef SIEVE_OF_ERATOSTHENES_HPRIME_SIEVE_HPP
#define SIEVE_OF_ERATOSTHENES_HPRIME_SIEVE_HPP
 
#include <algorithm>
Line 415:
* See https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes.
*/
class sieve_of_eratosthenesprime_sieve {
public:
explicit sieve_of_eratosthenesprime_sieve(size_t);
bool is_prime(size_t) const;
private:
Line 428:
* @param limit the maximum integer that can be tested for primality
*/
inline sieve_of_eratosthenesprime_sieve::sieve_of_eratosthenesprime_sieve(size_t limit) {
limit = std::max(size_t(3), limit);
is_prime_.resize(limit/2, true);
Line 448:
* @return true if the integer is prime
*/
inline bool sieve_of_eratosthenesprime_sieve::is_prime(size_t n) const {
if (n == 2)
return true;
Simonjsaunders
1,777

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/282979"