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 vote286 views1 answer
Qt make widget ignore mouse events
C++
0 vote311 views1 answer
Shrek c++
C++
0 vote355 views1 answer
Qt file explorer
C++
0 vote286 views1 answer
C++ tab
C++
0 vote334 views1 answer
How to make dictionary of numbers in c++
C++
3 votes298 views2 answers
Lambda function in c++
C++
0 vote315 views1 answer
Basic stack implementation in c++
C++
0 vote318 views1 answer
What is blob in computer vision
C++
0 vote297 views1 answer
C++ sort
C++
-1 vote318 views1 answer
C++ itoa
C++