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

15 votes173 views2 answers
Calculate factorial
C++
0 vote132 views1 answer
Pointers mcq sanfoundry
C++
0 vote178 views1 answer
Cpp set time
C++
19 votes207 views3 answers
File reading c++
C++
8 votes177 views2 answers
‘setprecision’ was not declared in this scope
C++
0 vote173 views1 answer
Stl reverse sort a array
C++
2 votes180 views2 answers
Tolower funciton in cpp
C++
0 vote198 views1 answer
How to use custom array in c++
C++
0 vote175 views1 answer
Swap of two numbers in c++
C++
1 vote172 views1 answer
Copy a part of a vector in another in c++
C++