Sieve of eresthossis cp 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

5 votes145 views1 answer
All library in c++
C++
1 vote133 views1 answer
Summary a long walk to water
C++
7 votes143 views6 answers
Sleep in c++
C++
0 vote164 views1 answer
Dijkstra algorithm in c++ geeksforgeeks
C++
0 vote132 views1 answer
C++ fill array with 0
C++
0 vote146 views1 answer
C++ meaning ::
C++
18 votes129 views4 answers
How to string to integer in c++
C++
0 vote143 views1 answer
Libc++abi.dylib: terminating with uncaught exception of type std::invalid_argument: stoi: no conversion
C++
0 vote128 views3 answers
C++ variable type
C++
0 vote150 views1 answer
How to type a vertical stack program c++
C++