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 votes189 views1 answer
Flutter margins
C++
1 vote209 views1 answer
How to reverse a string in c++ using reverse function
C++
0 vote203 views1 answer
Convert c code to java online free
C++
1 vote182 views1 answer
C++ logger class example
C++
17 votes173 views2 answers
Initialize an array in c++
C++
-1 vote202 views1 answer
How to pass arrays by reference c++
C++
1 vote188 views1 answer
Ue4 ftext to int
C++
0 vote212 views3 answers
C++ comment
C++
0 vote197 views1 answer
C++ allocate dynamic with initial values
C++
16 votes235 views5 answers
Sort array c++
C++