HDU2.1.2 How many prime numbers
来源:互联网 发布:知乎网站概述 编辑:程序博客网 时间:2024/06/15 21:50
就是判断质数,因为数据范围比较小,所以直接用最普通的判断方法即可,也就是枚举比其平方根小的数看看是不是它的因子。
如果数据范围很大的话可以用素数的线性筛法,以后应该会碰到。
代码如下:
#include <cstdio>#include <iostream>#include <algorithm>#include <cmath>using namespace std;bool isprime(int x){for(int i=2;i<=sqrt(x);i++)if(x%i==0)return 0;return 1;}int main(){int N;while(scanf("%d",&N)!=EOF){int count=0;for(int i=1;i<=N;i++){int x;scanf("%d",&x);if(isprime(x))count++;}printf("%d\n",count);}return 0;}
0 0
- HDU2.1.2 How many prime numbers
- hdu2.1.2 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 How many prime numbers
- hdu2138 How many prime numbers
- How many prime numbers 2138
- HDU2138 How many prime numbers
- HDU How many prime numbers
- HDU2138--How many prime numbers
- 2138 How many prime numbers
- HDU How many prime numbers
- 十八、How many prime numbers
- HDU-2138 How many prime numbers
- UVA - 10003 Cutting Sticks
- 网址
- 南邮 OJ 1949 比赛成绩排序问题
- 23. PHP include and require 文件
- C#使用Aggregate拼接字符串
- HDU2.1.2 How many prime numbers
- linux 通过命令行获取本机外网IP
- Linux变量键盘读取、数组与声明: read, array, declare
- poj解题报告——2419
- Android:操作图片Exif信息
- 用myeclipse创建webservice
- Android存储访问及目录
- 浅谈设计模式
- Miller-Rabin素数测试