/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 vote244 views2 answers
Ue4 c++ replicate actor variable
C++
1 vote299 views2 answers
Find the Missing Number
C++
11 votes177 views1 answer
Strcmp different length
C++
4 votes221 views1 answer
Convert all characters in string to uppercase c++
C++
0 vote203 views1 answer
Convert ascii char value to hexadecimal c++
C++
0 vote240 views2 answers
How to use decrement operator in c++
C++
0 vote222 views1 answer
Compile notepad++ c++
C++
4 votes212 views2 answers
C++ cin operator
C++
30 votes222 views2 answers
Integer range in c++
C++
2 votes213 views2 answers
C++ check palindrome
C++