How many prime numbers 2138
来源:互联网 发布:网络喷嘴 编辑:程序博客网 时间:2024/05/17 01:01
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 <cmath>bool isPrime(int x);int main(int argc, const char* argv[]){ int n; while (scanf("%d", &n) == 1) { int count = 0, input; while (n--) { scanf("%d", &input); if (isPrime(input)) { ++count; } } printf("%d\n", count); } return 0;}bool isPrime(int x){ for (int i=2; i<=sqrt(static_cast<double>(x)); ++i) { if (x % i == 0) { return false; } } return true;}
0 0
- How many prime numbers 2138
- 2138 How many prime numbers
- How many prime numbers
- How many prime numbers
- How many prime numbers
- How many prime numbers
- How many prime numbers
- How many prime numbers
- HDU-2138 How many prime numbers
- hdu 2138 How many prime numbers(miller_rabin?)
- HDU 2138 How many prime numbers
- HDU 2138 How many prime numbers
- hdu 2138 How many prime numbers
- hdu 2138 How many prime numbers
- hdu-2138-How many prime numbers
- hdu-2138- How many prime numbers
- HDU 2138 How many prime numbers
- hdu 2138 How many prime numbers
- Calculate the formula 2139
- C语言中printf格式化输出函数
- 道路运输车辆卫星定位系统标准符合性检测 ----操作方法与注意事项
- C++输出格式控制
- C#图像颜色域判断以及颜色直方图识别方法
- How many prime numbers 2138
- iframe标签实现form表单提交无页面刷新(不需要js)---解析
- smartctl获取raid卡下intel ssd寿命
- 多态
- CFontDialog对话框
- Decode Ways -- LeetCode
- 中英组合的思维方式探讨
- eclipse之The currrently displayed page contains invalid values错误
- SAP Sybase SQL Anywhere数据库JDBC访问(需要native dll)