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

44 votes335 views10 answers
Youtube
C++
1 vote272 views1 answer
How to specify how many decimal to print out with std::cout
C++
0 vote260 views1 answer
Shrek c++
C++
0 vote282 views1 answer
Run c++ program mac
C++
1 vote277 views1 answer
Ceil value in c++ using formula
C++
35 votes265 views6 answers
Ellipsis
C++
8 votes263 views3 answers
C++ check substring
C++
2 votes247 views1 answer
Multiline comment in C++
C++
0 vote255 views1 answer
Shuffle elements c++
C++
7 votes251 views5 answers
Set precision in c++
C++