*************** EEBPWS\EasyEx\HelloWo\   Write\   Program\
*************** HelloWo1.DPR ***************
PROGRAM   HelloWo1 ;
{$APPTYPE CONSOLE}
BEGIN
   Write (   'Hello World...'   );
END.
*************** HelloWo5.DPR ***************
PROGRAM   HelloWo5 ;
{$APPTYPE CONSOLE}
BEGIN
   WriteLn (   'Hello World.....'   );
   WriteLn (   'Hello World.....'   );
   WriteLn (   'Hello World.....'   );
   WriteLn (   'Hello World.....'   );
   WriteLn (   'Hello World.....'   );
END.
*************** HelloWo9.DPR ***************
PROGRAM   HelloWo9 ;
{$APPTYPE CONSOLE}
VAR
   i : Integer ;
BEGIN
   {----- LOOP }
   FOR i := 1 TO 9 DO BEGIN
      WriteLn (   'Hello World.........'   );
   END;
END.
*************** Writ2x2.DPR ***************
PROGRAM   Writ2x2 ;
{$APPTYPE CONSOLE}
BEGIN
   Write (   2 + 2   );
END.
*************** WritCalc.DPR ***************
PROGRAM   WritCalc ;
{$APPTYPE CONSOLE}
VAR
   R : Double ;
   C , A : Double ;
BEGIN
   R := 10 ;

   C := 2 * PI * R ;
   A := PI * R * R ;

   WriteLn (   'Radius='         ,  R   );
   WriteLn (   'Circumference='  ,  C   );
   WriteLn (   'Area='           ,  A   );
END.
*************** WritMsg.DPR ***************
PROGRAM   WritMsg ;
{$APPTYPE CONSOLE}
VAR
   MyMsg : String ;
BEGIN
   MyMsg :=  '- Nice weather, isn''t it ?'  +  #13#10
           + '- Yes "nice" weather.'        +  #13#10 ;

   Write (   MyMsg   );
END.
*************** Chr20_FF.DPR ***************
PROGRAM   Chr20_FF ;
{$APPTYPE CONSOLE}
VAR
   i : Integer ;
BEGIN
   Write (   '***** CHARS: '   );

   {----- LOOP }
   FOR i := 32 TO 255 DO BEGIN
      Write (   Chr(i)   );
   END;
END.
*************** PrimeNb.DPR ***************
PROGRAM   PrimeNb ;
{$APPTYPE CONSOLE}
VAR
   IsPrimeArray : ARRAY[1..1000] of Boolean ;
   i : Integer ;
   j , jMax : Integer ;
BEGIN
   Write (   '***** PRIME NUMBERS: '   );

   {----- LOOP 1 , On each number }
   FOR i := 1 TO 1000 DO BEGIN

      {----- Could be a prime number }
      IsPrimeArray[i] := TRUE ;

      j    := 2 ;
      jMax := i div 2 ;

      {----- LOOP 2 , Search a divisor }
      WHILE IsPrimeArray[i] and (j <= jMax) DO BEGIN
         {----- "j" can divide "i" ?  }
         IF (i mod j) = 0 THEN BEGIN
            IsPrimeArray[i] := False ;
         END;
         Inc ( j );
      END;

      {----- Display only prime numbers }
      IF IsPrimeArray[i] = TRUE THEN BEGIN
         Write (   i  ,  ' '   );
      END;
   END;

{
   [<--                   i                      -->]
    [<-- j -->]
   .#.....................#.........................#
    |         |                                     |
    2      i div 2                                1000

}
END.
