hdoj How many prime numbers （素数判断&暴力）

How many prime numbers

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 14697    Accepted Submission(s): 5097

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<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
bool getp(int n)
{
	int i,j;
	int flag=0;
	for(i=2;i<=sqrt(n*1.0);i++)
	{
		if(n%i==0)
		{
			flag=1;
			break;
		}
	}
	if(flag)
		return false;
	return true;
}
int main()
{
	int n;
	int i,j,x;
	while(scanf("%d",&n)!=EOF)
	{
		int cnt=0;
		while(n--)
		{
			scanf("%d",&x);
			if(getp(x))
				cnt++;
		}
		printf("%d\n",cnt);
	}
	return 0;
}