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 vote266 views1 answer
How to get the numbers in a vector c++ sfml
C++
0 vote233 views1 answer
How to format decimal palces in c++
C++
0 vote214 views1 answer
Print pattern and space in cpp
C++
0 vote221 views1 answer
Intlen in c++
C++
4 votes233 views1 answer
Sort vector struct c++
C++
0 vote226 views1 answer
Input n space separated integers in c++
C++
0 vote223 views1 answer
C++ little endian or big endian
C++
0 vote241 views1 answer
Stream Overloading
C++
0 vote235 views1 answer
How to add external library in clion
C++
0 vote233 views1 answer
C++ qt QFuture
C++