/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 vote173 views1 answer
QT form doesn't take changes
C++
0 vote184 views1 answer
Tutti i tipi di equazioni trigonometriche
C++
1 vote196 views1 answer
Area of a Circle in C++ Programming
C++
6 votes180 views2 answers
Create dynamic array c++
C++
1 vote174 views1 answer
Cpp executing without console
C++
1 vote194 views10 answers
C++ to python converter online
C++
6 votes159 views1 answer
Convert string to stream c++
C++
1 vote168 views1 answer
C++ accessing parent class functinons
C++
0 vote189 views1 answer
C++ cout update percentage
C++
0 vote229 views1 answer
Print elements of linked list
C++