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

6 votes135 views2 answers
Strcmp
C++
4 votes112 views1 answer
C++ array vs vector
C++
0 vote151 views1 answer
How to fill vector from inputs c++
C++
1 vote122 views1 answer
STD::ERASE FUNCTION IN C++
C++
0 vote137 views1 answer
How to store array of string with spaces in c++ stl
C++
0 vote132 views1 answer
Fast scan in c++
C++
0 vote128 views1 answer
Break input stream into words
C++
0 vote151 views1 answer
C++ add object to array
C++
0 vote116 views1 answer
Javidx9 age
C++
1 vote127 views1 answer
Merge images opencv c++
C++