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 vote98 views1 answer
What is handling null terminated string in c++
C++
6 votes117 views4 answers
Map c++
C++
1 vote115 views6 answers
Insertion sort
C++
0 vote107 views1 answer
C++ to mips assembly converter
C++
0 vote67 views1 answer
Postorder traversal calculator
C++
-1 vote106 views1 answer
Program to check smallest num in three numbers in c++
C++
0 vote112 views1 answer
One dimensiol array to two dimen c++
C++
0 vote113 views1 answer
How to find data size in c++
C++
0 vote112 views1 answer
C++ qt QFuture
C++
97 votes234 views6 answers
Change int to string c++
C++