/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

5 votes293 views3 answers
C++ random number within range
C++
0 vote332 views1 answer
How to create a c++ templeate
C++
3 votes298 views2 answers
Print type c++
C++
0 vote297 views1 answer
C++ rename function
C++
0 vote302 views2 answers
Shortest path in unweighted graph bfs
C++
0 vote343 views1 answer
How to format big numbers with commas in c++
C++
2 votes243 views1 answer
Read int from file c++
C++
0 vote292 views3 answers
Find the smallest window in a string containing all characters of another string
C++
0 vote318 views1 answer
Expresiones regulares español
C++
-1 vote306 views1 answer
String interpolation in c++
C++