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这个题居然不能打表。醉了。水的太水#include<iostream> #include<math.h> #include<stdio.h> using namespace std; int main() { int n,b,s,f,i; while(scanf("%d",&n)!=EOF) { s=0; while(n--) { scanf("%d",&b); f=0; for(i=2;i<=sqrt(b*1.0);i++) if(b%i==0) { f=1; break; } if(!f) s++; } printf("%d\n",s); } return 0; }