/C++/Prime numbers less than a given number c++

Prime numbers less than a given number c++

// This Function returns a vector containing all primes less than n using seive of eratosthenes
vector<long long> primes_less_than(long long n)
{
    vector<long long> ans(0);
    if (n <= 2)
        return ans;
    map<long long, bool> is_prime;
    for(long long i=0; i < n; i++) 
      	is_prime[i] = true;
    is_prime[0] = false;
    is_prime[1] = false;

    for (long long i = 2; i < sqrt(n); i++)
        if (is_prime[i])
            for (long long j = i * i; j < n; j += i)
                is_prime[j] = false;

    for(long long i=0; i < n; i++)
      	if (is_prime[i] == true) 
          	ans.push_back(i);
    return ans;
}

Similar codes

51 votes254 views3 answers
Phph date
C++
2 votes213 views3 answers
Online ide c++
C++
0 vote170 views1 answer
Remove the jth object from the subset
C++
56 votes241 views6 answers
List conda environments
C++
0 vote188 views1 answer
C++ classes
C++
0 vote192 views1 answer
C++ over load oprator to print variable of clas
C++
0 vote178 views1 answer
Cpp convert vector to set
C++
0 vote185 views1 answer
Inverted triangle c++
C++
2 votes191 views1 answer
Who to include a library c++
C++
6 votes148 views1 answer
Rng cpp
C++