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 vote167 views1 answer
How to show c++ binary files in sublime text
C++
0 vote162 views1 answer
How to fill vector from inputs c++
C++
9 votes137 views5 answers
Priority queue c++ min heap
C++
0 vote165 views1 answer
End vs cend in cpp
C++
0 vote189 views2 answers
Method
C++
1 vote174 views1 answer
Ue4 ftext to int
C++
1 vote155 views1 answer
Visual studio cpp compiler
C++
-5 votes163 views3 answers
Array syntax in c++
C++
0 vote173 views1 answer
While(n--)
C++
0 vote364 views1 answer
Opengl draw house using glut c++
C++