#include <iostream>
#include <cmath>
 
using namespace std;
 
static const int MAX = 500;
static const int MIN = 0;
static const int MAXCOL = 10;
 
bool isPrime(int r);
 
int main(int argc, char *argv[])
{
    int col = 0;
    int n;
 
    for(n=MIN; n<=MAX; n++)
      if(isPrime(n)){
          cout << n << '\t';
          col++;
          if(col == MAXCOL){
              cout << '\n';
              col = 0;
          }
      }  
 
  system("PAUSE");	
  return 0;
 
}
 
bool isPrime(int n)
{
    if((n == 0)||(n == 1))
        return false;
 
    int factors = 2;
 
    for(int i=2; i<=((int)sqrt((double)n)); i++){
        if(n%i == 0){
            factors++;
            break;
        }
    }
 
    if(factors == 2)
        return true;
 
   return false;
}

bool isPrime(int n)
{
bool prime ;
int  lim;
 
if ( n == 0 || n == 1 || n % 2 == 0)
   return(false);
 
prime = true;
lim = (int)sqrt(n); 
 
for(int i=3; i<= lim && prime ; i+=2)
       prime =  n % i;
return(prime);
}