HDU-2138 How many prime numbers
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了HDU-2138 How many prime numbers相关的知识,希望对你有一定的参考价值。
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
判断到sqrt(n)即可。
#include <iostream> #include <cmath> using namespace std; int main(void) { int t; long num[2000]; while(cin >> t) { int s = 0; for(int i = 0; i < t; i++) { cin >> num[i]; for(long j = 2; j <= sqrt(num[i]; j++) { if(num[i] % j == 0) { s++; break; } } } cout << t-s << endl; } return 0; }
以上是关于HDU-2138 How many prime numbers的主要内容,如果未能解决你的问题,请参考以下文章
I - How many prime numbers HDU - 2138
HDu 2138 How many prime numbers 高效Miller素数測试
HDU 2138 How many prime numbers
HDU 2138 How many prime numbers (判素数,米勒拉宾算法)