不错的代码

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

int is_prime(int x) { 
 int i;
 int n = (int)sqrt(x);
 if(x < 2)
   return 0;
 for(i = 2; i <= n; i++)
  if(x % i == 0)
    return 0;
  return 1;
}

int main()
{
 int n;
 int i;
 int counter = 0;
 int* p;
 printf("please input how many numbers will you check: ");
 scanf("%d", &n);
 p = malloc(n*sizeof(int));
 printf("please input the values of the numbers: (within blank or enter)");
 for(i = 0; i != n; i++) {
  scanf("%d", p+i);
 }
 for(i = 0; i != n; i++) {
  if(is_prime(p[i]))
   counter++;
 }
 printf("%d number(s) in total.\n", counter);
 return 0;
}