首页 > 代码库 > hdu 2138

hdu 2138

2024-07-09 13:41:14   220人阅读

How many prime numbers

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7352 Accepted Submission(s): 2360
 
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
 
Author
wangye
 
Source
HDU 2007-11 Programming Contest_WarmUp
 
Recommend
威士忌
 1 #include<iostream> 2 #include<math.h> 3 using namespace std; 4  5 int isprime(int x) 6 { 7     int i; 8      9     for(i=2;i<=sqrt(x);i++)           //用sqrt避免超时10         if(x%i==0)11             return 0;12     return 1;13 }14 int main()15 {16     int n,i,cnt;17     int a[1000];18     while(cin>>n&&n)19     {20         cnt=0;21         for(i=0;i<n;i++)22             cin>>a[i];23         for(i=0;i<n;i++)24             if(isprime(a[i]))25                 cnt++;26         cout<<cnt<<endl;27     }28     return 0;29 }

 


联系
我们