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 vote198 views1 answer
Cicli informatica c++
C++
3 votes216 views1 answer
Reference function in c++
C++
0 vote187 views1 answer
Move elements from vector to unordered_set
C++
1 vote196 views2 answers
How to print text on C++
C++
1 vote195 views1 answer
Unclebigbay
C++
3 votes195 views2 answers
A+b+c whole square
C++
2 votes205 views1 answer
C++ print current time
C++
0 vote232 views1 answer
C++ argument list for class template is missing
C++
3 votes211 views1 answer
C++ initialize array with all zeros
C++
-1 vote194 views1 answer
Pointer to constant
C++