/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

9 votes100 views4 answers
C++ vector print
C++
0 vote110 views1 answer
Detect end of user input cpp
C++
0 vote170 views1 answer
Even number program in c++ using for loop stack overflow
C++
39 votes126 views6 answers
How to Add to an Array
C++
0 vote150 views1 answer
How to use printf with <cinttypes> c++
C++
0 vote95 views1 answer
Executing an opencv c++ code
C++
0 vote93 views1 answer
Kadane algorithm with negative numbers included as sum
C++
0 vote52 views1 answer
Libraries required for gaming in c++
C++
0 vote142 views1 answer
Adddynamic ue4 c++
C++
0 vote108 views1 answer
10011101
C++