HDU #2138 How many prime numbers

原题地址
Problem Description
Give you a lot of positive integers, just to find out how many prime numbers there are.

Input
There are a lot of cases. In each case, there is an integer N representing the number of integers to find. Each integer won’t exceed 32-bit signed integer, and each of them won’t be less than 2.

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

Sample Input
3
2 3 4

Sample Output
2

原题意思：给你一堆整数，找出里面有多少个素数

输入：有很多测试，每次有一个整数N表示一堆数的个数，每个数不会超过32位signed整数，每个数不会少于2

输出：对于每个测试输出素数的个数

思路：32位，打表会超时，只需优化素数判定循环即可，先%2排除整数，再特判2，3循环里i从3开始，直到根号，每次+=2（排除i也为偶数）。

AC代码

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