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

1 vote219 views1 answer
Retourner pointeur de type qstringlist qt
C++
0 vote201 views1 answer
Shuffle elements c++
C++
0 vote196 views1 answer
Recherche recursive le max dans une liste
C++
0 vote208 views2 answers
Shortest path in unweighted graph bfs
C++
0 vote209 views1 answer
Compile c++ MPI Program
C++
4 votes182 views1 answer
Cin statement c++
C++
1 vote188 views1 answer
C++ vector structure
C++
0 vote197 views1 answer
C++ define constant in class header
C++
0 vote194 views1 answer
Txt auslesen c++
C++
0 vote191 views1 answer
Linux x11 copy paste event
C++