/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

0 vote300 views1 answer
Why return 0 in int main
C++
0 vote369 views1 answer
Binpow in fenwick tree
C++
2 votes292 views1 answer
Java print f int
C++
9 votes344 views4 answers
C++ vector print
C++
2 votes335 views2 answers
C++ in cmd
C++
7 votes314 views5 answers
Stack in c++
C++
0 vote316 views1 answer
Qt graphics scene map cursor position
C++
1 vote351 views1 answer
C++ strings equal
C++
5 votes290 views4 answers
Memset function c++
C++
0 vote311 views1 answer
130 divided by -10
C++