Prime number generator c++

#include <vector>
int main()
{
    std::vector<int> primes;
    primes.push_back(2);
    for(int i=3; i < 100; i++)
    {
        bool prime=true;
        for(int j=0;j<primes.size() && primes[j]*primes[j] <= i;j++)
        {
            if(i % primes[j] == 0)
            {
                prime=false;
                break;
            }
        }
        if(prime) 
        {
            primes.push_back(i);
            cout << i << " ";
        }
    }

    return 0;
}

Source: stackoverflow.com

Similar codes

23 votes230 views6 answers
Team fortress
C++
0 vote221 views1 answer
The program must enter a natural number n from the console and find the number previous to n that is not divisible by 2 , 3 and 5 .
C++
11 votes248 views2 answers
Convert decimal to binary c++
C++
1 vote230 views1 answer
Eosio check account exist
C++
1 vote219 views2 answers
Cpp vector2
C++
14 votes211 views5 answers
Length of array c++
C++
0 vote219 views1 answer
Cpp pass function with input to thread
C++
1 vote218 views1 answer
C++ std::string find and replace
C++
1 vote213 views1 answer
How to run code in devcpp
C++
12 votes221 views3 answers
Declare vector of size n in c++
C++