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

0 vote292 views1 answer
How to get characters through their ascii value in c++
C++
3 votes296 views2 answers
C++ vector element search
C++
0 vote324 views1 answer
Wap in c++ to understand function template
C++
0 vote344 views1 answer
Bitmap rotate 90 deg
C++
-1 vote326 views1 answer
How to print items in arduino
C++
1 vote337 views1 answer
C++ isalphanum
C++
0 vote337 views1 answer
Cpp execute command
C++
5 votes286 views4 answers
Memset function c++
C++
0 vote301 views1 answer
Softwareegg.courses4u
C++
0 vote302 views1 answer
Check if cin didn't get int
C++