求素数

最新推荐文章于 2019-08-16 15:16:24 发布

山农数学姜赫

最新推荐文章于 2019-08-16 15:16:24 发布

阅读量248

点赞数

CC 4.0 BY-SA版权

分类专栏：杭电。。。

本文链接：https://blog.youkuaiyun.com/zx8225885qw/article/details/51457711

杭电。。。专栏收录该内容

6 篇文章

订阅专栏

How many prime numbers

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 10683 Accepted Submission(s): 3504

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

Author

wangye

Source

HDU 2007-11 Programming Contest_WarmUp

Recommend

威士忌

#include <iostream>
#include <stdio.h>
#include <cmath>
using namespace std;
bool pao(int n)
{
    int i;
    int flag=0;
    if(n==2)
    return 1;
    for(i=2;i<sqrt(n)+1;i++)
    {
        if(n%i==0)
        {
            return 0;
        }
    }
    return 1;
}
int main()
{
    int t;
    int x;
    while(cin>>t)
    {
        int sum;
        sum=0;
        while(t--)
        {
            cin>>x;
            if(pao(x))
            {
                sum++;
            }
        }
        cout<< sum<<endl;
    }
    return 0;
}