/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 vote311 views2 answers
344. Reverse String c++
C++
0 vote301 views1 answer
Scan line in c++
C++
1 vote284 views1 answer
Binary representation c++
C++
0 vote345 views1 answer
How to use printf with <cinttypes> c++
C++
1 vote330 views1 answer
C++ cli convert string to string^
C++
3 votes291 views1 answer
What language was c+ written in
C++
14 votes300 views1 answer
How to make a n*n 2d dynamic array in c++
C++
0 vote288 views1 answer
C++ caps lock key
C++
0 vote286 views1 answer
C++ execution time
C++
1 vote310 views1 answer
Create file c++
C++