当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3978:Primes

题目描述
A pretty straight forward task, calculate the number of primes between 2 integers.

Given 2 integers A ≤ B < 105 what’s the number of primes in range from A to B inclusive.

Note: A prime number is a positive integer greater than 1 and is divisible by 1 and itself only. For N to be prime it is enough to test the divisibility of numbers less than or equal to square root of N.
输入解释
As many as 1000 lines, each line contains 2 integers A and B separated by a space. Input is terminated when A = B = -1 (Do not process this line).
输出解释
For every line in input – except for the last line where A = B = -1 - print the number of prime numbers between A and B inclusive.
输入样例
0 9999
1 5
-1 -1
输出样例
1229
3

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-3978

最后修改于 2020-10-29T07:17:16+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 65536