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 votes344 views1 answer
How to iterate through array in c++
C++
0 vote323 views1 answer
C++ capture screen as pixel array
C++
0 vote377 views1 answer
'std::ifstream file' has incomplete type and cannot be defined
C++
0 vote326 views1 answer
Assegnare valori in c++
C++
0 vote313 views2 answers
Lcm in c++
C++
0 vote316 views2 answers
Stack data structure c++
C++
0 vote368 views1 answer
Find with hash set
C++
2 votes308 views1 answer
Getch c++ library
C++
0 vote301 views1 answer
How to pronounce beaucoup
C++
27 votes332 views2 answers
How to remove an element from a vector by value c++
C++