/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 vote217 views1 answer
How to parse using stringstream
C++
0 vote239 views1 answer
Export gcc g++
C++
0 vote185 views1 answer
How to shorten code using using c++ in class with typename
C++
1 vote212 views1 answer
C++ isalphanum
C++
0 vote198 views2 answers
C++ program to find prime number using function
C++
1 vote214 views1 answer
For loop vector
C++
0 vote198 views2 answers
Lcm in c++
C++
1 vote243 views1 answer
How to read a line from the console in c++
C++
2 votes201 views1 answer
C++ time nanoseconds
C++
0 vote178 views9 answers
Convert c++ to python online
C++