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

0 vote124 views1 answer
How to add space in c++
C++
3 votes122 views2 answers
Set precision in c++ no decimal places\
C++
8 votes106 views1 answer
Arduino for command
C++
1 vote110 views2 answers
Auto i cpp
C++
0 vote101 views1 answer
Get start with c++
C++
0 vote110 views1 answer
How to read qlistwidget in c++
C++
12 votes115 views3 answers
Max element in array c++ stl
C++
4 votes119 views1 answer
How to check if a value is inside an array in c++
C++
0 vote105 views1 answer
C code to c++ converter
C++
0 vote115 views1 answer
Typeid().name() in c++
C++