Sieve of eratosthenes c++

int n;
vector<bool> 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

Sieve of eratosthenes 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

8 votes193 views5 answers
C++ vector resize
C++
0 vote179 views1 answer
C++ tab
C++
0 vote203 views1 answer
How to change the value of a key in hashmp in c++
C++
-1 vote177 views2 answers
Convert c++ to mips
C++
0 vote194 views1 answer
Recherche sur les dangers de quelques matériaux
C++
0 vote178 views1 answer
Test3
C++
7 votes191 views6 answers
Sleep in c++
C++
0 vote204 views1 answer
Split string on character vector C++
C++
5 votes276 views1 answer
How to sort a string in c++
C++
0 vote223 views1 answer
How to use jwt in login api in node js
C++