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 vote98 views1 answer
MPI_Sendrecv
C++
0 vote124 views1 answer
Check if float has decimals c++
C++
-1 vote120 views10 answers
Time complexity calculator online
C++
0 vote107 views1 answer
Ue4 c++ add tag
C++
3 votes110 views2 answers
Console colors in C++
C++
0 vote122 views2 answers
Decrement c++
C++
0 vote117 views1 answer
Srand() c++
C++
1 vote101 views1 answer
Declare nullptr c++
C++
4 votes117 views1 answer
How to compare lower case character to uppercase cpp
C++
0 vote120 views1 answer
Pretty Print c++ chegg
C++