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
Convert wchar_t to to multibyte
C++
4 votes119 views1 answer
Delete 2d dynamic array c++
C++
0 vote97 views1 answer
C++ enum rand
C++
0 vote109 views1 answer
Quicksort taking random pivot
C++
-2 votes104 views1 answer
English to french typing online
C++
5 votes93 views2 answers
C++ contains
C++
6 votes99 views4 answers
String to upper c++
C++
3 votes100 views3 answers
Get first element of set c++
C++
101 votes218 views6 answers
How to turn int into string c++
C++
0 vote99 views1 answer
All usefull stls in cpp imports
C++