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 vote337 views1 answer
Bit c++
C++
0 vote318 views1 answer
Zero fill in c++
C++
0 vote315 views2 answers
Union of two arrays
C++
0 vote384 views2 answers
Tu hi hai aashiqui song lyrics
C++
0 vote318 views1 answer
C++ execution time
C++
0 vote321 views1 answer
Count spaces in string java
C++
1 vote327 views1 answer
How to run code in devcpp
C++
2 votes370 views2 answers
C++ while true loop
C++
-5 votes326 views1 answer
Convert char or string to int or double
C++
0 vote323 views1 answer
Registering a new QML type
C++