Determine and output a prime number between 101-200

See the full set of "C language problem sets"

Title: Determine how many primes there are between 101-200, and output all primes.

1. Procedure Analysis:

The method of determining primes: To remove 2 to sqrt (this number) by a number, if divisible, indicates that the number is not prime, and vice versa.

2. Program Source code:

#include "stdio.h"
#include "conio.h"
#include "math.h"
Main ()
{
  int m,i,k,h=0,leap=1;
  printf ("\ n");
  for (m=101;m<=200;m++)
  {
    K=SQRT (m+1);
    for (i=2;i<=k;i++)
    if (m%i==0)
    {
      Leap=0;
      Break
    }
    if (LEAP)
    {
      printf ("%-4d", m);
      h++;
      if (h%10==0)
        printf ("\ n");
    }
    Leap=1;
  }
  printf ("\nthe total is%d", h);
  Getch ();
}

3.Visual C + + 6.0 debugging pass, as shown in figure: