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 vote357 views1 answer
Access first value in a set c++
C++
1 vote406 views1 answer
C++ return value of set insert
C++
0 vote339 views1 answer
Semi colon in argument list c++
C++
0 vote412 views1 answer
How to read wav file in C++
C++
2 votes381 views2 answers
C++ while true loop
C++
3 votes309 views2 answers
C++ get data type
C++
0 vote359 views1 answer
How to install boost c++ on windows
C++
0 vote338 views1 answer
Why do men drink liquor
C++
2 votes335 views1 answer
Cannot find "-lsqlite3" C++
C++
1 vote347 views1 answer
Print 5 table in c++
C++