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

0 vote204 views1 answer
Contoh space
C++
1 vote278 views1 answer
Arduino Sring to const char
C++
0 vote193 views1 answer
C++ to assembly
C++
0 vote254 views1 answer
C++ find index of all occurrences in string
C++
0 vote191 views1 answer
GlUniform bool
C++
2 votes195 views2 answers
Qt disable resizing window
C++
0 vote186 views1 answer
A variable with 2 independant variables plot
C++
38 votes268 views6 answers
Print hello world in c++
C++
14 votes264 views4 answers
Converting to string c++
C++
0 vote183 views1 answer
Why the << operator is friend
C++