/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

6 votes275 views2 answers
C++ string element access
C++
0 vote267 views3 answers
Get number round off to two decimal places c++
C++
0 vote296 views1 answer
Dream speedrun music free download mp3
C++
0 vote261 views2 answers
Get min and max element index from vector c++
C++
0 vote261 views1 answer
How to show constellations in starry night orion special edition
C++
1 vote271 views1 answer
How to make sure the user inputs a int and not anything else c++
C++
0 vote273 views1 answer
Get rid of those includes c++
C++
0 vote288 views1 answer
Compile in c++
C++
5 votes278 views2 answers
Vbs check if file exists
C++
0 vote298 views1 answer
Get map values c++
C++