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

4 votes267 views2 answers
Escape sequence in c++
C++
2 votes322 views2 answers
Print stack c++
C++
3 votes341 views1 answer
Abs c++
C++
0 vote346 views1 answer
Pointers mcq sanfoundry
C++
0 vote334 views1 answer
Variabili in c++
C++
0 vote346 views1 answer
Gfgdf
C++
1 vote353 views3 answers
Auto in cpp
C++
1 vote352 views1 answer
Ray sphere intersection equation
C++
1 vote307 views1 answer
How to reset linerenderer unity
C++
0 vote312 views1 answer
What type is this c++
C++