hdu2138素数

How many prime numbers

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

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
  
  
  
  

   
   AC代码：
  
  
  
  

   
   
//hdu-2138素数
//坑爹的水题；本来以为不打表会超时；没想到打表就数组越界；后来请教了
//其他人人才知道就是直接可以暴力过。亥，。。。 
#include<stdio.h>
#include<string.h>
#include<math.h>
bool Is_prim(int x)
{
	if(x==1) return false;
	else
	{
		int i,m;
		m=sqrt(x);
		for(i=2;i<=m;i++)
		 if(x%i==0)
		  return false;
    return true;
	}
}
int main()
{
	int n,a,ans;
	while(scanf("%d",&n)!=EOF)
	{
		int i;
		ans=0;
		for(i=0;i<n;i++)
		{
			scanf("%d",&a);
			if(Is_prim(a))
			 ans++;
		} 
		printf("%d\n",ans);
	} 
return 0;
}