Sieve of eratosthenes c++

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

Source: cp-algorithms.com

Sieve of eratosthenes c++

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

Source: cp-algorithms.com

Similar codes

0 vote232 views3 answers
Onoverlapbegin ue4 c++
C++
0 vote241 views1 answer
C++ meaning ::
C++
11 votes231 views6 answers
How to take input in 2d vector in c++
C++
1 vote209 views1 answer
How to reset linerenderer unity
C++
44 votes259 views10 answers
Youtube
C++
0 vote234 views1 answer
How many months have 31 days
C++
0 vote253 views1 answer
C++ write number to registry
C++
0 vote245 views1 answer
Pascal triangle using c++
C++
0 vote240 views1 answer
Compile c++ MPI Program
C++
0 vote220 views1 answer
Unknown amount of threads cpp
C++