/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 vote155 views1 answer
130 divided by -10
C++
5 votes179 views1 answer
How to sort a string in c++
C++
-1 vote138 views2 answers
Run cpp code
C++
18 votes154 views5 answers
Cpp rand
C++
0 vote163 views2 answers
Vector übergeben c++
C++
18 votes154 views2 answers
Stl for sorting IN C++
C++
3 votes139 views1 answer
Set precision with fixed c++
C++
1 vote94 views1 answer
Cheak a number is positive are negative in c ++ in loop
C++
0 vote148 views3 answers
Dynamic memory c++
C++
96 votes301 views4 answers
Change int to string cpp
C++