/*********************************************
*           TABLE OF PRIME NUMBERS           *
* ------------------------------------------ *
* This small program writes a table of prime *
* numbers from 1 to N (here N=2000).         *
* ------------------------------------------ *
*                                            *
*                C++ version by J-P Moreau.  *
*                    (www.jpmoreau.fr)       *
*********************************************/
#include <stdio.h>


void main() {

  int i, j, m, N, prem, Premier[400], Raye[2001];

  N = 2000;

  for(i=0; i<N+1; i++) Raye[i]=0;
  Raye[1] = 1;

  prem = 1;
  while (prem*prem <= N) { 
    do { 
      prem++;
      if ((prem > N) || (Raye[prem]==0)) break;
    } while(1);
    i = 2*prem;
    while (i<=N) {
      Raye[i] = 1;
      i = i + prem;
    }
  }
  
  j = 0;
  for (i=1; i<N+1; i++) 
    if (Raye[i]==0)  {
      j++; 
      Premier[j] = i;
    }

  m=0;
  printf(" Between 1 and %d, there are %d prime numbers:\n\n",N,j);
  for (i=1; i<j+1; i++)  {
    m++;
    printf("%5d",Premier[i]);
    if (m==15) { printf("\n"); m=0; }
  }
  printf("\n");

}

// end of file primes.cpp