/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

1 vote245 views1 answer
&& c++
C++
2 votes252 views2 answers
C++ sum the digits of an integer
C++
5 votes270 views1 answer
How to use comparator funtion in priority queue in c++
C++
0 vote310 views1 answer
Delete a node from binery search tree c++
C++
0 vote290 views1 answer
Adding variables c++
C++
-1 vote271 views4 answers
Convert c++ to c online
C++
0 vote270 views1 answer
Ask a question and answer it in code c++
C++
2 votes275 views1 answer
How to complie with c++ 17
C++
1 vote313 views1 answer
C++ uniform_real_distribution get same result
C++
4 votes283 views3 answers
Check lowercase letters c++
C++