=============== EEPHP\EasyEx\HelloWo\   Print\   Program\
===============   HelloWo1.C   ===============

#include <stdio.h>

void  main  ( )
{
   printf (   "Hello World..."   );
}

===============   HelloWo5.C   ===============

#include <stdio.h>

void  main  ( )
{
   printf (   "Hello World.....\n"   );
   printf (   "Hello World.....\n"   );
   printf (   "Hello World.....\n"   );
   printf (   "Hello World.....\n"   );
   printf (   "Hello World.....\n"   );
}

===============   HelloWo9.C   ===============

#include <stdio.h>

void  main  ( )
{
   int  i ;

   /*----- LOOP */
   for ( i = 1 ; i <= 9 ; i++ )  {
      printf (   "Hello World.........\n"   );
   }
}

===============   Prin2x2.C   ===============

#include <stdio.h>

void  main  ( )
{
   printf (   "%d"  ,  2 + 2   );
}

===============   PrinCalc.C   ===============

#include <stdio.h>
#include <math.h>

void  main  ( )
{
   float  R ;
   float  C , A ;

   R = 10 ;

   C = 2 * M_PI * R ;
   A = M_PI * R * R ;

   printf (   "Radius=%E\n"         ,  R   );
   printf (   "Circumference=%E\n"  ,  C   );
   printf (   "Area=%E\n"           ,  A   );
}

===============   PrinMsg.C   ===============

#include <stdio.h>
#include <string.h>

void  main  ( )
{
   char   MyMsg[256];
   char*  p ;

   p = MyMsg ;
   p[0] = 0 ;

   p=stpcpy(p,  "- Nice weather, isn'it ?\n"  );
   p=stpcpy(p,  "- Yes \"nice\" weather.\n"   );

   printf (   MyMsg   );
}

===============   Chr20_FF.C   ===============

#include <stdio.h>

void  main  ( )
{
   int  i ;
   char  MsgBuf[2];

   printf (   "***** CHARS: "   );

   /*----- LOOP */
   for ( i = 32 ; i <= 255 ; i++ )  {
      MsgBuf[0] = i ;
      MsgBuf[1] = 0 ;
      printf (   MsgBuf   );
   }
}

===============   PrimeNb.C   ===============

#include <stdio.h>
#include <stdlib.h>

#define   TRUE   1
#define   False  0

void  main  ( )
{
   char  IsPrimeArray[1001];
   unsigned int  i ;
   unsigned int  j , jMax ;
   div_t  DivResult ;

   printf (   "***** PRIME NUMBERS: "   );

   /*----- LOOP 1 , On each number */
   for ( i = 1 ; i <= 1000 ; i++ )  {

      /*----- Could be a prime number */
      IsPrimeArray[i] = TRUE ;

      j    = 2 ;
      DivResult = div ( i , 2 );
      jMax = DivResult.quot ;

      /*----- LOOP 2 , Search a divisor */
      while (IsPrimeArray[i] && (j <= jMax))  {
         /*----- "j" can divide "i" ? */
         if ((i % j) == 0)
            IsPrimeArray[i] = False ;
         j++ ;
      }

      /*----- Display only prime numbers */
      if (IsPrimeArray[i] == 1)
         printf (   "%d "  ,  i   );
   }

/*
   [<--                   i                      -->]
    [<-- j -->]
   .#.....................#.........................#
    |         |                                     |
    2      i div 2                                1000
*/
}
