Answers for "sieve of eratosthenes start from n"

Sieve of Eratosthenes

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;
    }
}

Posted by: Guest on January-19-2022

Code answers related to "sieve of eratosthenes start from n"

Code answers related to "C#"

C# Answers by Framework

Browse Popular Code Answers by Language

Answers for "sieve of eratosthenes start from n"

Code answers related to "sieve of eratosthenes start from n"

Code answers related to "C#"

C# Answers by Framework

Browse Popular Code Answers by Language

Answers for "sieve of eratosthenes start from n"

Code answers related to "sieve of eratosthenes start from n"

Code answers related to "C#"

C# Answers by Framework

Browse Popular Code Answers by Language

Popular Programming Languages

Advertisements

Company

Compilers

Help

Connect with us