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

5 votes229 views1 answer
C++ short if
C++
0 vote235 views1 answer
C++ construnctor
C++
2 votes153 views2 answers
How to check if java is installed on windows 10
C++
0 vote205 views1 answer
Lists occurrences of characters in the string c++
C++
1 vote205 views2 answers
Auto i cpp
C++
14 votes132 views5 answers
C++ Type Casting
C++
7 votes202 views2 answers
Qt int to string
C++
1 vote173 views3 answers
Print 2d array c++
C++
0 vote186 views1 answer
Sfml time set
C++
0 vote187 views1 answer
Runtime error(Exit status:153(File size limit exceeded)) c++
C++