HDOJ---ACMSteps---2.1.2How many prime numbers

How many prime numbers

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

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

32 3 4

 

Sample Output

2

 

#include <iostream>#include <cstdio>#include <cmath>using namespace std;bool primt(int x){    if(x!=2&&x%2==0)        return false;    int i;    for(i=3;i<=sqrt((double)x);i+=2)    {        if(x%i==0)            {                return false;            }    }    return true;}int main(){    int x,i,s,k;    while(~scanf("%d",&x))    {        s=0;        for(i=0;i<x;i++)        {            scanf("%d",&k);                if(primt(k))                    s++;        }        printf("%d\n",s);    }    return 0;}