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 vote114 views1 answer
Find with hash set
C++
0 vote109 views1 answer
Access part of string in c++
C++
21 votes100 views6 answers
Convert char to string c++
C++
0 vote192 views1 answer
Ind the number of digits of a given integer n .
C++
11 votes126 views2 answers
Convert decimal to binary c++
C++
0 vote101 views1 answer
How to pronounce beaucoup
C++
4 votes112 views2 answers
How to hide the console c++
C++
-1 vote66 views1 answer
Execute executable in c++
C++
0 vote61 views1 answer
Pointers mcq sanfoundry
C++
0 vote108 views1 answer
Find min and max in array c++
C++