/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 vote224 views1 answer
GoPro camera for kids aus
C++
2 votes222 views1 answer
C++ compare strings ignore case
C++
0 vote234 views1 answer
How to add numbers in c++
C++
104 votes312 views6 answers
Integer to string c++
C++
0 vote234 views1 answer
Static_cast c++
C++
0 vote246 views2 answers
Comment savoir si un nombre est premier c++
C++
1 vote231 views4 answers
Return function in cpp
C++
0 vote240 views1 answer
All in one c++
C++
0 vote229 views1 answer
Delay millis arduino
C++
0 vote221 views1 answer
C++ error missing terminating character
C++