HDU How many prime numbers

Problem Description

Give you a lot of positive integers, just to find out how many prime numbers there are.

Output             For each case, print the number of prime numbers you have found out.

Sample Input 3 2 3 4

Sample Output 2

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int is_primer(int n)
{
    int i, num ;
    num = floor(sqrt(n) + 0.5);
    for(i = 2; i <= num; i++)
        if(n % i == 0) return 0;
    return 1;
}
int main(void)
{
   int n, i, count;
   while(scanf("%d", &n) != EOF){
        count = 0;
        for(i = 1; i <= n; i++){
            long long int num;
            scanf("%lld", &num);
            int val = is_primer(num);
            if(val) count++;
        }
            printf("%d\n", count);
   }
   return 0;
}