Sieve of eresthossis cp 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 vote190 views1 answer
Finding no of unique characters in a string c++
C++
0 vote318 views1 answer
Constant qualifier c++ "error display"
C++
1 vote204 views1 answer
3d projection onto 2d plane algorithm
C++
0 vote141 views1 answer
Getting int command line arguments c++
C++
0 vote179 views1 answer
Sweetalert2 email and password
C++
1 vote175 views1 answer
How to traverse a linked list in c++
C++
0 vote331 views1 answer
Time and date (tm structure ) in C++
C++
-1 vote221 views1 answer
Attention nlp
C++
0 vote184 views1 answer
Read a whole line from the input
C++
0 vote193 views1 answer
Use of strstr in c++
C++