/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 vote119 views1 answer
Program to convert int to int array c++
C++
0 vote121 views1 answer
Return the index where maximum element in a vector
C++
0 vote114 views1 answer
How to loop through a set of pairs in c++
C++
20 votes96 views3 answers
C++ open file
C++
3 votes104 views1 answer
What is a variable in cpp
C++
1 vote108 views1 answer
Dev c++ tahe last word error
C++
0 vote117 views1 answer
Unordered map c++
C++
-1 vote102 views1 answer
Easy c++ code
C++
0 vote105 views2 answers
Total sales in array c++ two dimensional array
C++
0 vote108 views1 answer
How to create an ArrayList
C++