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

0 vote146 views1 answer
C++ map values range
C++
2 votes139 views1 answer
C++ print current time
C++
1 vote143 views1 answer
Unique ptr c++
C++
0 vote186 views1 answer
The statement vector vector int matrix(100 vector int (50 100) ) declares
C++
0 vote146 views1 answer
Ue4 modular character
C++
10 votes128 views2 answers
Check if character in string c++
C++
0 vote136 views1 answer
Arduino C++ servomotor random moving
C++
0 vote136 views1 answer
Sum of n natural numbers in c
C++
0 vote141 views1 answer
C++ declare binary number
C++
0 vote130 views1 answer
The amount of input is unknown
C++