How many prime numbers |
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) |
Total Submission(s): 7775 Accepted Submission(s): 2506 |
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<iostream>
#include<string> #include<cstring> #include<iomanip> #include<cstdio> #include<algorithm> #include<vector> #include<cmath> using namespace std; int main() { int N,temp,cont,lm; while(cin>>N) { cont=0; while(N>0) { N--; bool check=false; cin>>temp; lm=sqrt(temp); for(int i=2;i<=lm;i++) { if(!(temp%i)) {check=true;break;} } if(!check)cont++; } cout<<cont<<endl; } return 0; } |
acm steps 2.1.2(How many prime numbers)
最新推荐文章于 2019-07-28 19:37:29 发布