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

2 votes210 views1 answer
Final in c++
C++
15 votes213 views4 answers
C++ vector
C++
0 vote220 views1 answer
C++ synchronization primitives example programs
C++
29 votes244 views6 answers
How to convert string to int in c++
C++
1 vote199 views1 answer
Name one example of a “decider” program that you regularly encounter in real life.
C++
0 vote263 views1 answer
How to pass std::array with unknown size to function C++
C++
19 votes225 views6 answers
Rand() c++
C++
1 vote215 views1 answer
Ue4 spawn actor c++
C++
0 vote234 views1 answer
How to make an enum in c++
C++
0 vote219 views1 answer
Implementing split function in c++
C++