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

1 vote192 views10 answers
Test
C++
0 vote201 views1 answer
Std::cout and cout
C++
0 vote184 views2 answers
C++ function for checking if a sting is a number
C++
0 vote207 views1 answer
Convert c code to java online free
C++
0 vote215 views1 answer
Dynamic memory allocation for string in c++
C++
0 vote189 views1 answer
Priority queue smallest first
C++
0 vote182 views1 answer
C++ program to convert kelvin to celsius
C++
5 votes198 views1 answer
How to disable buttons in unity
C++
0 vote253 views2 answers
C++ program to find prime number using function
C++
0 vote204 views1 answer
C++ read_ascii
C++