HDU 2138

ow 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

#include<iostream>
#include<cmath>
using namespace std;
int prime(int x)
{
	int i;
	if(x<=2) return 1;
	for(i=2;i<=sqrt(x*1.0);i++)
	{
		if(x%i==0)
		{
			return 0;
			break;
		}
	}
	return 1;
}
int main()
{
	int n,m,count;
	while(cin>>n)
	{
		count=0;
	   for(int i=0;i<n;i++)
		{
		  cin>>m;
		  if(prime(m))
		    count++;
		}
		cout<<count<<endl;
	}
}