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 vote117 views1 answer
C code to c++ converter
C++
70 votes181 views5 answers
Erase element from vector c++
C++
0 vote133 views1 answer
All permutations with repetition C++
C++
2 votes121 views1 answer
Pointer in c++
C++
1 vote123 views3 answers
If else c++
C++
0 vote136 views1 answer
What is the format specifier for dword c++
C++
0 vote120 views1 answer
Check whether K-th bit is set or not c++
C++
1 vote116 views2 answers
How to print text on C++
C++
1 vote127 views1 answer
What is a .cpp file
C++
0 vote116 views1 answer
Cpp pushfront vector
C++