/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 vote128 views1 answer
Initialize string with length c++
C++
0 vote86 views1 answer
1ll
C++
3 votes135 views2 answers
Infinity c++
C++
0 vote117 views1 answer
Tree to array c++
C++
6 votes110 views2 answers
C++ string element access
C++
0 vote125 views1 answer
What does map.count() return in c++
C++
-1 vote140 views1 answer
How to pass arrays by reference c++
C++
7 votes126 views5 answers
Stack c++
C++
0 vote122 views1 answer
What does sultion mean in a particle model
C++
4 votes201 views1 answer
Arduino uno hello world
C++