Breaking News: Grepper is joining You.com. Read the official announcement!

sieve of eratosthenes c++

Add Answer

tough life answered on November 9, 2020 Popularity 9/10 Helpfulness 3/10

answer sieve of eratosthenes c++

related sieve of eratosthenes c++

related Sieve of Eratosthenes c++

related c++ sieve of eratosthenes

related Sieve of Eratosthenes in C++

sieve of eratosthenes c++

Comment

int n;
vector<char> is_prime(n+1, true);
is_prime[0] = is_prime[1] = false;
for (int i = 2; i <= n; i++) {
    if (is_prime[i] && (long long)i * i <= n) {
        for (int j = i * i; j <= n; j += i)
            is_prime[j] = false;
    }
}

Popularity 9/10 Helpfulness 3/10 Language cpp

Source: cp-algorithms.com

Tags: c++ sieve-of-eratosthenes

Link to this answer
Share Copy Link

Contributed on Nov 09 2020

tough life

0 Answers Avg Quality 2/10

Closely Related Answers

sieve of eratosthenes c++

Comment

int n;
vector<bool> is_prime(n+1, true);
is_prime[0] = is_prime[1] = false;
for (int i = 2; i <= n; i++) {
    if (is_prime[i] && (long long)i * i <= n) {
        for (int j = i * i; j <= n; j += i)
            is_prime[j] = false;
    }
}

Popularity 10/10 Helpfulness 7/10 Language cpp

Source: cp-algorithms.com

Tags: c++

Link to this answer
Share Copy Link

Contributed on Nov 09 2020

tough life

0 Answers Avg Quality 2/10

Sieve of Eratosthenes c++

Comment

    #include <cmath>
    #include <vector>
	using namespace std;
	int n;
    vector<int> ans;
    vector<bool> is_prime(n+1, true);
    is_prime[0] = is_prime[1] = false;
    for (int i = 2; i <= sqrt(n); i++) {
        if (is_prime[i]) {
            for (int j = i * i; j <= n; j += i)
                is_prime[j] = false;
        }
    }
    for(int i=2;i<is_prime.size();i++){
        if(is_prime[i]){
            ans.push_back(i);
        }
    }

Popularity 8/10 Helpfulness 5/10 Language cpp

Source: Grepper

Tags: c++ sieve-of-eratosthenes sieve-

Link to this answer
Share Copy Link

Contributed on Sep 20 2022

luco

0 Answers Avg Quality 2/10

c++ sieve of eratosthenes

Comment

#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>

#define N 1000000	//N is the Range (0..N)

bitset < N+1 > numbers;
vector < int > primes;

void sieve(){
    numbers.set();
    numbers[1] = 0;

    for (int i = 2; i < N; i++){
        if (numbers[i] == 1){
            cout<<i<<endl;
            primes.push_back(i);
            for (int j = i*i; j<=N; j+=i)
                numbers[j] = 0;
        }
    }
}

Popularity 9/10 Helpfulness 4/10 Language cpp

Source: Grepper

Tags: algorithm algo

Link to this answer
Share Copy Link

Contributed on Jul 11 2022

ALeonidou

0 Answers Avg Quality 2/10

Sieve of Eratosthenes in C++

Comment

#include <vector>

std::vector<bool> sieveOfEratosthenes(int limit) {
    std::vector<bool> isPrime(limit + 1, true);
    isPrime[0] = isPrime[1] = false;

    for (int p = 2; p * p <= limit; ++p) {
        if (isPrime[p]) {
            for (int i = p * p; i <= limit; i += p)
                isPrime[i] = false;
        }
    }

    return isPrime;
}

bool isPrime(int number) {
    if (number <= 1)
        return false;

    std::vector<bool> isPrimeList = sieveOfEratosthenes(number);
    return isPrimeList[number];
}

Popularity 6/10 Helpfulness 1/10 Language cpp

Source: chat.openai.com

Tags: c++ sieve-of-eratosthenes

Link to this answer
Share Copy Link

Contributed on Jun 18 2023

Darshan Trivedi

0 Answers Avg Quality 2/10

sieve of eratosthenes c++

Contents

More Related Answers

sieve of eratosthenes c++

Closely Related Answers

sieve of eratosthenes c++

Sieve of Eratosthenes c++

c++ sieve of eratosthenes

Sieve of Eratosthenes in C++

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.