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

10 votes349 views4 answers
Toupper c++
C++
1 vote341 views1 answer
How to read a line from the console in c++
C++
0 vote345 views1 answer
Operator overloading outside class
C++
2 votes306 views2 answers
Slice a vector c++
C++
1 vote251 views1 answer
Add element to start of vector c++
C++
4 votes279 views3 answers
C++ vector combine two vectors
C++
0 vote358 views1 answer
How to check sqrt of number is integer c++
C++
10 votes289 views1 answer
How to append one vector to another c++
C++
0 vote326 views1 answer
Memset array bool
C++
0 vote290 views1 answer
Error uploading arduino code
C++