========== HelloWo1.C ==========

#include <stdio.h>

void  main  ( )
{
   printf (   "Hello World..."   );
}
                                       +---------------------------------------
========== HelloWo5.C ==========       ! ========== Chr20_FF.C ==========
#include <stdio.h>                     ! #include <stdio.h>
void  main  ( )                        ! void  main  ( )
{                                      ! {
   printf (   "Hello World.....\n"   );!    int  i ;
   printf (   "Hello World.....\n"   );!    char  MsgBuf[2];
   printf (   "Hello World.....\n"   );!    printf (   "***** CHARS: "   );
   printf (   "Hello World.....\n"   );!    //----- LOOP
   printf (   "Hello World.....\n"   );!    for ( i = 32 ; i <= 255 ; i++ )  {
}                                      !       MsgBuf[0] = i ;
========== HelloWo9.C ==========       !       MsgBuf[1] = 0 ;
#include <stdio.h>                     !       printf (   MsgBuf   );
void  main  ( )                        !    }
{                                      ! }
   int  i ;                            ! ========== PrimeNb.C ==========
                                       ! #include <stdio.h>
   //----- LOOP                        ! #include <stdlib.h>
   for ( i = 1 ; i <= 9 ; i++ )  {     ! #define   TRUE   1
      printf("Hello World.........\n");! #define   False  0
   }                                   ! void  main  ( )
}                                      ! {
========== Prin2x2.C ==========        !    char  IsPrimeArray[1001];
#include <stdio.h>                     !    unsigned int  i ;
void  main  ( )                        !    unsigned int  j , jMax ;
{                                      !    div_t  DivResult ;
   printf (   "%d"  ,  2 + 2   );      !    printf ( "***** PRIME NUMBERS: " );
}                                      !    //----- LOOP 1 , On each number
========== PrinCalc.C ==========       !    for ( i = 1 ; i <= 1000 ; i++ )  {
#include <stdio.h>                     !       //----- Could be a prime number
                                       !       IsPrimeArray[i] = TRUE ;
void  main  ( )                        !
{                                      !       j    = 2 ;
   float  R ;                          !       DivResult = div ( i , 2 );
   float  C , A ;                      !       jMax = DivResult.quot ;
                                       !
   R = 10 ;                            !       //----- LOOP 2 , Search adivisor
                                       !       while (IsPrimeArray[i]
   C = 2 * 3.14159 * R ;               !                     && (j <= jMax))  {
   A = 3.14159 * R * R ;               !          //----- "j" can divide "i" ?
                                       !          if ((i % j) == 0)
   printf (   "Radius=%e\n"        ,R);!             IsPrimeArray[i] = False ;
   printf (   "Circumference=%e\n" ,C);!          j++ ;
   printf (   "Area=%e\n"          ,A);!       }
}                                      !
========== PrinMsg.C ==========        !       //----- Display onlyprimenumbers
#include <stdio.h>                     !       if (IsPrimeArray[i] == 1)
#include <string.h>                    !          printf (   "%d "  ,  i   );
void  main  ( )                        !    }
{                                      ! }
   char  MyMsg[1024];                  +---------------------------------------

   strcpy ( MyMsg , "- Nice weather, isn'it ?\n" );
   strcat ( MyMsg , "- Yes \"nice\" weather.\n" );

   printf (   MyMsg   );
}
