Title: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
题目分析:
1、关键写个判定素数的函数
代码如下:
#include<iostream>
#include<math.h>
using namespace std;
bool isPrime(int a)
{
for(int i=2;i<=sqrt(a);i++)
if(a%i==0)
return false;
return true;
}
int main()
{
int n,m;
while(scanf("%d",&n)!=EOF)
{
int count=0;
while(n--)
{
cin>>m;
if(isPrime(m))
count++;
}
cout<<count<<endl;
}
return 0;
}