ArrayPrime.cpp

#include <iostream>

using namespace std;

bool isPrime( int n ){
      for( int i=2; i< n; i++ ) {
         if( n % i == 0 ) {
            return false;
         }
      }
      return true;
}

int main()

{

   int Primes[100];

   int currentcheck;
   int primeamount;

   while ( Primes!=100 )
   {
      for ( int i=1; i<=Primes; i++ )

         if ( isPrime(i) ) cout<<i<<endl;

   }

   return 0;

}