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 vote323 views1 answer
Initializer before void c++
C++
0 vote337 views2 answers
Comment savoir si un nombre est premier c++
C++
0 vote313 views1 answer
Decising how many numbers after comma c++
C++
0 vote313 views1 answer
Set keybinding for compiling c++ program in neovim
C++
-2 votes335 views1 answer
How to iterate through array in c++
C++
12 votes313 views2 answers
Underline in latex
C++
3 votes475 views3 answers
Class cpp
C++
0 vote318 views1 answer
What algorithm does bitcoin use
C++
3 votes330 views2 answers
Find maximum sum in array of contiguous subarrays
C++
2 votes308 views1 answer
Cannot find "-lsqlite3" C++
C++