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 vote161 views1 answer
For_each c++
C++
0 vote145 views1 answer
Set Specific Time in youtube Video url
C++
0 vote164 views1 answer
Tabeau dynamique c++
C++
-1 vote158 views1 answer
C++ forloop
C++
0 vote179 views1 answer
How to input a file path in c++
C++
0 vote135 views6 answers
Python converter to c
C++
8 votes103 views1 answer
How to print every element of the array in cpp
C++
0 vote138 views1 answer
Print octal number in c++
C++
0 vote149 views1 answer
Print elements of linked list
C++
-2 votes139 views2 answers
C++ random float
C++