/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 vote156 views1 answer
Play audio c++
C++
4 votes147 views3 answers
Converting char to int in c++
C++
1 vote134 views1 answer
Cpp code for euclids GCD
C++
5 votes95 views2 answers
Variables in c++
C++
0 vote137 views1 answer
Namespace c++
C++
-1 vote149 views1 answer
51 13 C:\Users\usuario\Documents\Destajo 1.cpp [Error] 'gotoxy' was not declared in this scope
C++
0 vote138 views1 answer
Cpp pass function with input to thread
C++
12 votes165 views2 answers
C++ cast char to string
C++
0 vote131 views1 answer
Read large files part by part in C++
C++
0 vote140 views1 answer
C++ static array in Klasse
C++