程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> hdu 2138 How many prime numbers (素數判定)

hdu 2138 How many prime numbers (素數判定)

編輯:C++入門知識

hdu 2138 How many prime numbers (素數判定)


How many prime numbers

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8205 Accepted Submission(s): 2642 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
Author wangye Source HDU 2007-11 Programming Contest_WarmUp





解題思路:直接判定是否為素數即可。




AC代碼:

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
#define INF 0x7fffffff

bool isprim(int n){              //判斷是否為素數
    for(int i=2; i<=(double)sqrt((double)n); i++){
        if(n%i == 0) return false;
    }
    return true;
}

int main()
{
    #ifdef sxk
        freopen("in.txt","r",stdin);
    #endif
    int n, x, ans;
    while(scanf("%d",&n)!=EOF)
    {
        ans = 0;               //計數
        while(n--){
            scanf("%d", &x);
            if(isprim(x)) ans ++;
        }
        printf("%d\n", ans);
    }
    return 0;
}




  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved