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 vote310 views1 answer
Number of nodes of bst cpp
C++
23 votes377 views2 answers
User input c++
C++
0 vote366 views1 answer
Convert all strings in vector to lowercase or uppercase c++
C++
0 vote354 views2 answers
What are manipulators in c++
C++
0 vote357 views1 answer
Call function from separate bash script
C++
2 votes335 views2 answers
Print stack c++
C++
0 vote329 views1 answer
What does sultion mean in a particle model
C++
1 vote369 views1 answer
C++ encapsulation
C++
0 vote337 views1 answer
Tutti i tipi di equazioni trigonometriche
C++
1 vote322 views1 answer
Ue4 ftext c++
C++