/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 vote289 views1 answer
Std::ifstream cant read file to large
C++
0 vote317 views1 answer
Remove item from layout
C++
0 vote311 views1 answer
Ex: java script
C++
0 vote270 views1 answer
Redragon m609 weight
C++
0 vote292 views1 answer
C++ get environment variable
C++
0 vote318 views1 answer
Clean list widget qt
C++
5 votes308 views6 answers
Do while loop c++
C++
0 vote284 views1 answer
Strring length in c++
C++
0 vote284 views1 answer
Inline in class in C++
C++
0 vote300 views1 answer
Post order from preorder and inorder calculator
C++