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

2 votes282 views2 answers
String split by space c++
C++
4 votes276 views3 answers
REFERENCE C++
C++
0 vote288 views1 answer
Ue4 modular character
C++
1 vote264 views1 answer
Array 2d to 1d
C++
30 votes284 views5 answers
Remove value from vector c++
C++
34 votes237 views6 answers
C++ string to int
C++
0 vote278 views5 answers
Run time calculator c++
C++
1 vote289 views3 answers
How to take space separated input in c++
C++
0 vote239 views1 answer
Count bit 1 c++
C++
12 votes268 views2 answers
Underline in latex
C++